pnispel/insertion_sort.cpp

## insertion_sort.cpp
int * sort (int arr [], int len) {
  for (int i = 1; i < len; i++) {
    int key = arr[i];
    int j = i - 1;

    while (j >= 0 && arr[j] > key) {
      arr[j + 1] = arr[j];
      j = j - 1;
    }

    arr[j + 1] = key;
  }

  return arr;
}
	int * sort (int arr [], int len) {
	for (int i = 1; i < len; i++) {
	int key = arr[i];
	int j = i - 1;

	while (j >= 0 && arr[j] > key) {
	arr[j + 1] = arr[j];
	j = j - 1;
	}

	arr[j + 1] = key;
	}

	return arr;
	}