👩💻 Join our community of thousands of amazing developers!
Previously, we covered some of the beginner sorting algorithms that are able to get the job done but quickly go out of hand with larger datasets. Now we get can start digging into some of the more efficient big boy algorithms, like merge sort. With this, we can move from the O(n^2) algorithms to a much more scalable O(nlogn) solution. Prerequisites Being able to think about time and space complexity via Big O Notation will be incredibly helpful. We’re also going to be looking at recursion-based ...