InsertSort

int InsertSort(int arr[]) {
 
    for (int i = 1; i < SIZE; i++) {
        int CurrentValue = arr[i];
        int j = i;
        for (; j > 0; j--) {
            if (CurrentValue < arr[j - 1]) arr[j] = arr[j - 1];
            else break;
        }
 
        arr[j] = CurrentValue;
 
    }
 
    cout << " Insert Sort " << endl;
    Print(arr);
 
    return 0;
}