Merge sort is similar to quick sort as it makes use of recursion and Divide and Conquer technique. It complexity is O(n log n) as the pivot point is always in the middle. The main idea behind merge sort is to keep breaking down the problem until we reach such small units that by the … Continue reading Merge Sort

Quick sort is making use of recursion so if you are not familiar with recursion, I recommend going through my Introduction to recursion post. This algorithm also makes use of a technique which is called Divide and Conquer. The basic idea behind it is, instead of dealing with an instance of a problem at its … Continue reading Quick Sort