Question

How to implement insertion sort in C++

Answer 1

#include <iostream>
#include <ctime>

#define SIZE 6

void print_array(int arr[], int size) {
    for (int i = 0; i < size; i++) {
        std::cout << arr[i] << " ";
    }
}
 
void insertion_sort(int arr[], int size) {
    int j, tmp;
      
    for (int i = 1 ; i < size; i++) { 
        j = i;
       
        while (j > 0 && arr[j] < arr[j - 1]) {
            tmp = arr[j];
            arr[j] = arr[j - 1];
            arr[j - 1] = tmp;
            j--;
        }
    }
}
  
 
int main(void)
{
    int arr[SIZE], i;
    int size = sizeof(arr) / sizeof(arr[0]);
   
    srand(time(NULL));
     
    for (i = 0; i < size; i++) {
         arr[i] = rand() % 100 + 1;
    }
     
    print_array(arr, size);
     
    std::cout << "\n";
      
    insertion_sort(arr, size);
      
    std::cout << "\nafter insertion_sort:\n\n";
    print_array(arr, size);
}
  
 
 
  
/*
run:
  
4 20 92 57 64 71 

after insertion_sort:

4 20 57 64 71 92 
 
*/

 

70+ SQL courses for beginners and professionals