Quick sort, or partition-exchange sort, is a soting alguritm developed by tont haris that, on avrage makes O(n log n) comparisons to sort n items. In the worth case, it makes O(n2) comparisons, though this behavior is rare.it helps you to put something in right order
Bubble sort, sometimes incorrectly referred to as sinking sort, is a simple sorting alguritm that works by repeatedly stepping through the list to be sorted, comparing each part of adjacent items and swapping them if they are in the wrong order.
A simple, but not very efficient, alguritm for arranging a set of n numbers in order of magnitude. The method starts with the left-hand pair of numbers, swapping them if necessary