改进的插入排序

#include<iostream>
#include <stdlib.h>
using namespace std;
void insertion(int a[], int l, int r);
int main() {
	int a[7] = { 5,4,9,6,8,3,4 };
	insertion(a, 0, 6);
	for (int i = 0; i <= 6; i++) {
		cout << a[i] << endl;
	}
	system("pause");
	return 0;
}

void insertion(int a[], int l, int r) {
	int t;
	int v;
	/*	for (int i = r; i > l; i--) {
			if (a[i] < a[i - 1])
			{
				t = a[i - 1];
				a[i - 1] = a[i];
				a[i] = t;

			}//if
		}//for
	*/
	for (int j = l + 1; j <= r; j++) {
		int k = j;
		v = a[k];
		while (a[k - 1] > v)
		{
			a[k] = a[k - 1];
			k--;
		}//while
		a[k] = v;

	}//for

}//insertion