插入排序InsertionSort(C++实现)

// insertion sort
#include <iostream>
using namespace std;
//非降序
void insertionSort(int* s, int n) {
for (int i = 1; i < n; ++i) {
//s[0]默认排好了
int key = s[i];//记录key值
int j = i - 1;
while (j >= 0 && s[j] > key) // 移动到最顶端或小于等于的key
s[j + 1] = s[j--];
s[j + 1] = key;
}
}

//非升序
void insertionSort(int* s, int n) {
for (int i = 1; i < n; ++i) {
//s[0] 默认排好了
int key = s[i];
int j = i - 1;
while (j >= 0 && s[j] < key)
s[j + 1] = s[j--];
s[j + 1] = key;
}
}

int main(){
int a[] = {1,5,3,2,1};
insertionSort(a, 5);
for (int i = 0; i < 5; ++i) {
cout << a[i]<<" ";
}
}