排序

#include <string.h>


void (int arr[], int lsize);
//交换函数
void Swap_ele(int *prev, int *late);
//遍历数组
void PrintfArr(int *arr);

int main()
{
	int arr[6] = { 3, 6, 1, 2, 9, 7 };
	int n = sizeof arr / sizeof *arr;
	printf("%dn", n);
	PrintfArr(arr, n);
	printf("n");
	insert_sort(arr, sizeof arr / sizeof *arr);
	PrintfArr(arr, sizeof arr / sizeof *arr);
	printf("n");
	return 0;
}

//交换函数
void Swap_ele(int *prev, int *late)
{
	int n;
	n = *prev;
	*prev = *late;
	*late = n;
}


void (int arr[], int lsize)
{
	int i, j;

	for (i = 0; i < lsize; i++)
	{
		
		for (j = i ; j >= 0 && j < lsize - 1; j--)
		{
			int n = arr[j ];
			if (arr[j ] < arr[j-1])
			{
				/*arr[j ] = arr[j-1];
				arr[j] = n;*/
				Swap_ele(&arr[j], &arr[j-1]);
			}
			
		}
	}
}

//遍历数组
void PrintfArr(int arr[],int n)
{
	for (int i = 0; i < n ;i++)
	{
		printf("%d ", arr[i]);
	}
}