Sorting Algorithms.
Process: Steps 2–4 are repeated until the entire array is sorted. Time and Space Complexity Analysis Time Complexity: Best Case: O(n) — When the array is already sorted, and no or minimal insertions are needed. Worst Case: O(n²) — When the array is sorted in reverse order. Average Case: O(n²) — On