Skip to content

Instantly share code, notes, and snippets.

What would you like to do?
// Function to sort an array a[] of size 'n'
void insertionSort(int a[], int n)
int i, loc, j, k, selected;
for (i = 1; i < n; ++i)
j = i - 1;
selected = a[i];
// find location where selected sould be inseretd
loc = binarySearch(a, selected, 0, j);
// Move all elements after location to create space
while (j >= loc)
a[j+1] = a[j];
a[j+1] = selected;
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment