排序模板

1.冒泡排序（O(n²)）最好情况下 O(n)

for(int i = 0; i < n-1; i++)//升序
	 {
	 	for(int j = 0; j < n-1-i; j++)
	 	{
	 		if(a[j] > a[j+1])
	 		{
	 			int temp = a[j];
	 			a[j] = a[j+1];
	 			a[j+1] = temp;
			 }
		 }
	 }

2.插入排序(O(n²))

 int first = 0, last = n, temp, j;//升序
	 for (int i = first+1; i < last; i++)
	 {
	 	temp = a[i];
	 	j = i-1;
	 	while((a[j] > temp) && (j >= 0))
	 	{
	 		a[j+1] = a[j];
	 		j--;
		 }
		 if(j != i-1)
		 {
		 	a[j+1] = temp;
		 }
	 }