In this episode of Algorithm Design and Analysis we'll break down the merge sort sorting algorithm, and implement it in JavaScript. This requires us to dive into recursion and take a divide-and-conquer approach to sorting an array.
I upload videos like this one as well as live stream coding session on my YouTube channel.
To keep up with everything I’m doing, follow me on Twitter and dev.to. If you’re thinking, “Show me the code!” you can find me on GitHub.
Top comments (0)