简单算法；冒泡排序和用指针交叉互换

#define _CRT_SECURE_NO_WARNINGS 1
#include<stdio.h>
#include<string.h>
void Sort(int arr[],int sz){
	for (int i = 0; i < sz - 1; i++) {
		for (int j = 0; j < sz - i - 1; j++) {
			if (arr[j] > arr[j + 1]) {
				int tem = arr[j + 1];
				arr[j + 1] = arr[j];
				arr[j] = tem;//判断条件，创建变量交换
			}
		}
	}
}
void Print(int arr[], int sz) {
	for (int i = 0; i < sz; i++) {
		printf("%d", arr[i]);
  	 }
}//打印
int main()
{
	int arr[] = { 9,8,7,4,5,6,3,2,1,10 };
	int sz = sizeof(arr) / sizeof(arr[0]);//计算数组中个数
	 Sort(arr, sz);
	 Print(arr, sz);
	return 0;
}

#define _CRT_SECURE_NO_WARNINGS 1
#include<stdio.h>
#include<string.h>
void Sort(int* p, int sz) {
	int left = 0;
	int right = sz - 1;
	int tem = 0;
	while (left < right)
	{
		
							 tem = p[right];
							p[right] = p[left];
						p[left] = tem;
						left++;
							right--;//判断条件，条件满足退出while循环


	}

}
void Print(int arr[], int sz) {
	for (int i = 0; i < sz; i++) {

		printf(" %d", arr[i]);
	}
}
int main()
{
	int arr[] = { 9,8,7,4,5,6,3,2,1,10 };
	int sz = sizeof(arr) / sizeof(arr[0]);//计算数组中个数
	 Sort(arr, sz);
	 Print(arr, sz);

	return 0;
}