Sorting algorithms every developer and CS student should know.
Sorting algorithms
bubble sort
type: in-place
complexity:
worst case: O(n^2) comparisons, O(n^2) swaps.
Repeatedly looping through the list and comparing adjacent elements.
If the adjacent elements are unsorted, they are swapped with each other....
iamshree.hashnode.dev8 min read