插入排序（降序）

#include<iostream>
#include<vector>

using namespace std;

void INSERTIONSORT_DOWN(vector& a) {
int length = a.size();
int c;
for (int i=1;i<length;i++)
{
for (int j = i; j >= 1;j–) {
if (a[j] > a[j - 1])
{
c = a[j];
a[j] = a[j - 1];
a[j - 1] = c;
}
else break;
}
}
cout << "size of a is " << length << endl;
}

int main() {
vector num = {22,35,66,84,12,32,10,9};
//while (cin >> i)
// num.push_back(i);

INSERTIONSORT_DOWN(num);
for (auto e : num)
	cout << e << " " << endl;
return 0;

}