The common sorting algorithms can be divided into two
classes by the complexity of their algorithms-O(n2
) which
includes bubble sort, insertion sort, selection sort [6] etc., and
O(n log n) which include heap sort [2], quick sort [7], merge
sort. Algorithmic complexity is generally written in terms of
Big-O notation, where the ’O’ represents the complexity of the
algorithm and a value n represents the size of the set the
algorithm is run against [5], [10].