There is a good collection of algorithms on sortings techniques categorized under their execution behaviour which is known as complexity. Some algorithms like Bubble Sort, Selection Sort, Insertion Sort have complexity O(n^2) where as other
algorithms like Quick Sort, Heap Sort have complexty O(nlogn). Authors have proposed a slight variation to Bubble sort by introducing a new appraoch for implementing the bubble sort