Tracing a Merge Sort algorithm (AQA A Level Computer Science)

In this video you will learn about the Merge Sort sorting algorithm. You will see a visual short overview of the divide-and-conquer method, before an explanation of a pseudocode representation of a recursive Merge Sort algorithm. Finally, you will watch a walk-through of an exam question that requires you to complete a trace table for the same recursive algorithm.

This is a long video, however it is hoped that you will find parts, if not all, of it helpful in developing your understanding of this algorithm.

[austossen]

i'm surprised this video only has 1500 hits, it's a perfect example of how algorithms should be taught, especially for a mysterious behavior like recursion, it covers the stack of recursive calls, which closes the gap of understanding, something my own professor didn't cover, in other words, this video is praiseworthy

[geoinator]

Thanks man, you're a legend. This video has helped and hopefully i can retain this knowledge for the upcoming exam. I like how you were slowly going insane as the question was progressing and coming to a close, definitely relatable!

[AdityaSharma-bcgb]

Genius way of showing comparisons, I didnt need to know code for my final, but I needed to know the tracing for the sorts. Thank you so much for showing proper tracing.

[SalmanMKC]

Wow thanks, without this I would have been so lost in the exam

[davidfomin]

Thank you so much! I was really struggling with this

[emanuelpercy]

Great video 🔥 which tool did you use to make this video

[Mahmzo]

to be honest to do all this in around 6 mins ( taking a mini a mark rule ) is kinda tough. i would rather lose 6 marks and secure marks elsewhere instead of wasting time. but i am going for the A* so i need to be able to do this xD

[zohaib.m]

Is the pseudo code in the question the same one they would give in an exam? (There would be small changes, maybe the list going smallest to biggest) but would the overall pseudo code be the same?