Implementation of Insertion Sort in C++

insertion-sort.cpp

// numbers = array of numbers
// size = length of numbers

void insertionSort(int *numbers,int size){
  int i, j, key;
  for (j=1; j<size; j++) {
    key = numbers[j];
    i = j - 1;
    while(i>=0 and numbers[i]>key){
      numbers[i+1] = numbers[i];
      i = i - 1;
    }
    numbers[i+1] = key;
  }
}