Sorting Algorithms.
based on their time complexity in different cases: Bubble Sort: Best Case: O(n) Worst Case: O(n²) Average Case: O(n²) Selection Sort: Best Case: O(n²) Worst Case: O(n²) Average Case: O(n²) Insertion Sort: Best Case: O(n) Worst Case: O(n²) Average Case: O(n²) Merge Sort: Best Case: O(n log n) Worst