Articles in this series
My notes on the above topic
Insertion sort used the incremental approach to designing algorithms; having sorted the array A[1..j-1], we inserted the element A[j] in its correct position. Now, we look at the divide and conquer approach to designing algorithms, post which we wil...
