Created
March 5, 2021 05:57
-
-
Save gunavaran/da3e739e5ea424f0b06a4a320c8d641c to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// Acknowledgement: https://www.geeksforgeeks.org/insertion-sort/ | |
// C program for insertion sort | |
#include <math.h> | |
#include <stdio.h> | |
/* Function to sort an array using insertion sort*/ | |
void insertionSort(int arr[], int n) | |
{ | |
int i, key, j; | |
for (i = 1; i < n; i++) { | |
key = arr[i]; | |
j = i - 1; | |
/* Move elements of arr[0..i-1], that are | |
greater than key, to one position ahead | |
of their current position */ | |
while (j >= 0 && arr[j] > key) { | |
arr[j + 1] = arr[j]; | |
j = j - 1; | |
} | |
arr[j + 1] = key; | |
} | |
} | |
// A utility function to print an array of size n | |
void printArray(int arr[], int n) | |
{ | |
int i; | |
for (i = 0; i < n; i++) | |
printf("%d ", arr[i]); | |
printf("\n"); | |
} | |
/* Driver program to test insertion sort */ | |
int main() | |
{ | |
int arr[] = { 12, 11, 13, 5, 6 }; | |
int n = sizeof(arr) / sizeof(arr[0]); | |
insertionSort(arr, n); | |
printArray(arr, n); | |
return 0; | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment