Skip to content
This repository has been archived by the owner on Aug 28, 2022. It is now read-only.

Latest commit

 

History

History
45 lines (41 loc) · 1.07 KB

README.md

File metadata and controls

45 lines (41 loc) · 1.07 KB
Raw

Sorting Algorithms

A Sorting Algorithm is used to rearrange a given array or list elements according to a comparison operator on the elements. The comparison operator is used to decide the new order of element in the respective data structure.

Types of Sorting Algorithms:

  1. Selection Sort
  2. Bubble Sort
  3. Recursive Bubble Sort
  4. Insertion Sort
  5. Recursive Insertion Sort
  6. Merge Sort
  7. Iterative Merge Sort
  8. Quick Sort
  9. Iterative Quick Sort
  10. Heap Sort
  11. Counting Sort
  12. Radix Sort
  13. Bucket Sort
  14. ShellSort
  15. TimSort
  16. Comb Sort
  17. Pigeonhole Sort
  18. Cycle Sort
  19. Cocktail Sort
  20. Strand Sort
  21. Bitonic Sort
  22. Pancake sorting
  23. Binary Insertion Sort
  24. BogoSort or Permutation Sort
  25. Gnome Sort
  26. Sleep Sort
  27. Structure Sorting in C++
  28. Stooge Sort
  29. Tag Sort
  30. Tree Sort
  31. Cartesian Tree Sorting
  32. Odd-Even Sort / Brick Sort
  33. QuickSort on Singly Linked List
  34. QuickSort on Doubly Linked List
  35. 3-Way QuickSort (Dutch National Flag)
  36. Merge Sort for Linked Lists
  37. Merge Sort for Doubly Linked List
  38. 3-way Merge Sort