Bubble Sort And Cocktail Shaker Sort: Efficient Sorting Algorithms
We're learning Bubble Sort & Cocktail Shaker Sort! Bubble Sort: swaps adjacent elements, O(n^2) time complexity, but easy to implement. Cocktail Shaker Sort: does forward & backward traversal, reduces swaps needed, still impractical for large data.
Hey reader , welcome back so lets brush up what we learnt last article so we've discussed about insertion sort and selection sort , one works by shifting and inserting other by finding smallest and swapping , merge sort works by divide and conquor and merging and quicksort works by sorting around a pivot etc etc and so on check on the older article if u haven't read that already lets throw in our route map again 1) insertion sort [x] 2) selection sort [x] 3) merge sort [x] 5) quick sort [x] 6) bubble sort < 7) cocktail shaker sort < 8) heap sort 9) priority ques 10) counting sort 11) radix...