Sorting algorithms

1. https://en.wikipedia.org/wiki/Sorting_algorithm#Comparison_of_algorithms

TODO https://www.geeksforgeeks.org/sorting-algorithms/

Elementary sorting algorithms

While these algorithms are simple to understand and implement, they are not efficient for large datasets due to their O(n^2) time complexity. They are often used for educational purposes or when dealing with small datasets where efficiency is not a major concern.

1. Selection Sort
2. Insertion Sort
3. Bubble Sort

Non-elementary sorting algorithms

More sophisticated algorithms like Merge Sort and Quick Sort are preferred for larger datasets due to their O(n log n) time complexity.

1. Bucket Sort
2. Counting Sort
3. Heap Sort
4. Merge Sort
5. Quick Sort
6. Radix Sort
7. Shell Sort
8. Quick sort vs Merge sort

Tags

1. Comparator interface vs Comparable interface
2. Stable Sorting