SortAlgorithms

This repository shows implementation for the Major Sort Algorithm. Aim not to use LINQ or similar ease to use, but memory unefficient technique.

Implemented Sort Algorithm

You can check various benchmark patterns at GitHub Actions/Benchmark.

Exchange

• Bubble Sort
• Cocktail Shaker Sort
• Odd-Even Sort
• Comb Sort
• Circle Sort

Selection

• Selection Sort
• Double Selection Sort
• Cycle Sort
• Pancake Sort

Insertion

• Insertion Sort
• Pair Insertion Sort
• Binary Insertion Sort
• Gnome Sort
• Library Sort
• Merge Insertion Sort
• Shell Sort
  • Knuth1973
  • Sedgewick1986
  • Tokuda1992
  • Ciura2001
  • Lee2021

Merge

• Merge Sort
• Pingpong Merge Sort
• Bottom-Up Merge Sort
• Rotate Merge Sort
  • Iterative
  • Recursive
• SymMerge Sort
• Natural Merge Sort
• Tim Sort
• Power Sort
• Shift Sort
• Spin Sort
• Spin Sort (Boost)

Heap

• Heap Sort
• Ternary Heap Sort
• Bottom-Up Heap Sort
• Weak Heap Sort
• Smooth Sort
• Tournament Sort

Partition

• Quick Sort
• Quick Sort (3-Way)
• Quick Sort (Median of 3)
• Quick Sort (Median of 9)
• Quick Sort (Dual Pivot)
• Quick Sort (Stable)
• Block Quick Sort
• Intro Sort
• Intro Sort (Dotnet)
• Pattern-Defeating Quick Sort
• std::sort (LLVM)

Adaptive

• Drop-Merge Sort
• Patience Sort
• Strand Sort

Distribution

• Counting Sort
• Pigeonhole Sort
• Bucket Sort
• Flash Sort
• Radix LSD Sort (Base 4)
• Radix LSD Sort (Base 10)
• Radix LSD Sort (Base 256)
• Radix MSD Sort (Base 4)
• Radix MSD Sort (Base 10)
• American Flag Sort
• Spread Sort

Network

• Bitonic Sort
  • Iterative
  • Recursive
• Batcher Odd-Even Merge Sort

Tree

• Binary Tree Sort (BST)
• Binary Tree Sort (AVL)
• Splay Sort
• Treap Sort

Joke

• Bogo Sort
• Slow Sort
• Stooge Sort