This project has the objective of studying sorting algorithms and C++.
It is a simple program that prompts the user to input the number of elements that will be stored in a dynamically allocated array, to input the way that it is ordered (i.e. Crescent, Decrescent or Random) and to input the sorting algorithm.
Finally the program outputs the time consumed just to sort the array.
A slow simple comparison sorting algorithm that repeatedly steps through the list to be sorted, compares each pair of adjacent items and swaps them if they are in the wrong order.
Aimple sorting algorithm that builds the sorted array one element at a time, creating a sorted list every iteration before adding a new element.
Another simple in-place comparison sort, creating a sorted list every iteration and then finding the smallest (or largest, depending on sorting order) element in the unsorted sublist to insert in the sorted iteration.
One of the more efficient comparison sorts, very similar to selection sort.
A divide and conquer based Sorting technique, preserves the input order of equal elements in the sorted output(stable).
A comparison-based sorting algorithm that divides its input into a sorted and an unsorted region, and it iteratively shrinks the unsorted region by extracting the largest element and moving that to the sorted region. The improvement consists of the use of a heap data structure rather than a linear-time search to find the maximum