insertion_sort

#include <iostream>
using namespace std;

void insertionSort(int arr[], int n) {
    for (int i = 1; i < n; i++) {
        int key = arr[i];
        int j = i - 1;
        while (j >= 0 && arr[j] > key) {
            arr[j + 1] = arr[j];
            j--;
        }
        arr[j + 1] = key;
    }
}

int main() {
    int arr[] = {5, 2, 9, 1, 5, 6};
    int n = 6;

    cout << "Original array: ";
    for (int i = 0; i < n; i++) cout << arr[i] << " ";

    insertionSort(arr, n);

    cout << "\nSorted array (Insertion Sort): ";
    for (int i = 0; i < n; i++) cout << arr[i] << " ";

    cout << "\n\nTime Complexity: O(n^2)\nSpace Complexity: O(1)\n";
    return 0;
}