Best Case: O(n²)

Sorting algorithms with a best case performance of Ω(n²).

Algorithms

• Cycle Sort
• Selection Sort

---

A best case performance of Ω(n²) is as bad as it gets. These algorithms are too ineficient to be practical in any scenario.