Algorithms
- Comparison
- Non-Comparison
  - Radix Sort
Performance
- Best Case
  - Ω(n)
  - Ω(n log (n))
  - Ω(n²)
  - Ω(nk)
- Average Case
  - Θ(n)
  - Θ(n log (n))
  - Θ(n²)
  - Θ(nk)
- Worst Case
  - O(n)
  - O(n log (n))
  - O(n²)
  - O(nk)
Examples
- Bubble Sort
  - Java
  - Java (Generic)
  - Python3
  - Javascript
  - C++
  - Swift
- Cycle Sort
  - Java
  - Java (Generic)
  - Python3
  - Javascript
  - C++
  - Swift
- Heapsort
  - Java
  - Java (Generic)
  - Javascript
  - C++
- Insertion Sort
  - Java
  - Java (Generic)
  - Python3
  - Javascript
  - C++
  - Swift
- Merge Sort
  - Java
  - Java (Generic)
  - Python3
  - Javascript
  - C++
- Quicksort
  - Java
  - Java (Generic)
  - Python3
  - Javascript
  - C++
  - Swift
- Selection Sort
  - Java
  - Java (Generic)
  - Python3
  - Javascript
  - C++
  - Swift
- Shellsort
  - Java
  - Java (Generic)
  - Javascript
  - C++
- Radix Sort
  - Java

© 2020 Big-O | Privacy Policy
Facebook | Twitter | Instagram

Performance
Worst Case
O(n)

Worst Case: O(n)

It is not possible for a comparison sorting algorithm to opperate at this speed in the worst case.