We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Sorting
  4. Insertion Sort - Part 2
  5. Discussions

Insertion Sort - Part 2

  • michaelchen0611
     + 0 comments

    Time Complexity: O(n^2)

    Space Complexity: O(1)

    void printf_arr(int n, int* arr){
    for (int i = 0; i<n; i++){
        printf("%d ", arr[i]);
    }
    printf("\n");
}

void swap(int* a, int* b){
    *a = *a ^ *b;
    *b = *a ^ *b;
    *a = *a ^ *b;
}

void insertionSort2(int n, int arr_count, int* arr) {
    if (n == 1) printf("%d", arr[0]);
    for (int i = 1; i<n ; i++){
        int temp_idx = i;
        while (temp_idx > 0 && arr[temp_idx] < arr[temp_idx-1]){
            swap(&arr[temp_idx], &arr[temp_idx-1]);
            temp_idx --;
        }
        printf_arr(n, arr);
    }
}