gistfile1.txt

void Sort::insertionSort(int *arr, int size) {
    int key = 0;
    for (int i=1; i < size; i++) {
        key = arr[i];
        
        // Move elements of arr[0..i-1], that are greater than key,
        // to one position ahead of their current position.
        int j = i-1;
        while (j>=0 && arr[j] > key) {
            arr[j+1] = arr[j];
            j = j-1;
        }
        arr[j+1] = key;
    }
}