Insertion Sort

An insertion sort is a bit of a special case. It assumes that you will be given a set of values over time, and as you get them, you will insert the value into its correct location based upon the given values. Depending upon the data, and size, you could utilize different types of sort,…

Merge Sort

Like the Quick Sort, the Merge Sort uses a divide and conquer method to help sort the data. In a given array, you start to subdivide your array into smaller arrays, sorting the data as you go along, only to merge it back together when you are done. The way you sort the data is…