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 Sorted

While similar in name to the Merge Sort, the Merge Sorted is a bit of a special case type of sort, and shares none of the same methodology.  In it, you take two, or more sources, which are already sorted, and you merge them together. As you merge them together, you determine from which list,…

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…

Formatting Output in C++

Setting the precision of numeric data is a little more complicated in C++ than in some other languages.First you, will need to include iomanip as a library to use some of these modifiers. A common method is to pass in stream manipulators to the stream to get numbers for format correctly. Some of the modifiers…