//选择排序法
void selectsort()
{
int a[N] = { 5,1,6,8,4 };
int t, i, j;
for (i = 0; i < (N - 1); i++)
{
for (j = i + 1; j < N; j++)
{
if (a[i] > a[j])
{
t = a[i]; a[i] = a[j]; a[j] = t;
}
}
}
for (int i = 0; i < N; i++)
{
printf("%d", a[i]);
}
}
//冒泡排序法
void bubblesort()
{
int a[N] = { 6,3,5,1,7 };
int i, j, mid;
for (i = 0; i < N-1; i++)
{
for (j = 0; j < N-i-1 ; j++)
{
if (a[j] > a[j+1])
{
mid = a[j]; a[j] = a[j+1]; a[j+1] = mid;
}
}
}
for (i = 0; i < N; i++)
{
printf("%d", a[i]);
}
}
//max—min
void bubblesort_max()
{
int a[N] = { 1,2,3,4,5 };
int j,i,mid;
for (i=1;i<N;i++)
{
for (j = 0; j < N - i; j++)
{
if(a[j]<a[j+1])
{
mid = a[j]; a[j] = a[j + 1]; a[j + 1] = mid;
}
}
}
for (i = 0; i < N; i++)
{
printf("%d", a[i]);
}
}
//插入排序
void insertsort()
{
int arr[] = { 7,9,4,8,5,1,2,3,6 };
int data;
int i, j;
for (i = 1; i < 9; i++)
{
data = arr[i];
for (j = i - 1; j >= 0 && arr[j] > data; j--)
{
arr[j + 1] = arr[j];
}
arr[j + 1] = data;
}
for (i = 0; i < 9; i++)
printf("%d", arr[i]);
}
//素数判断
void sushu()
{
int i = 2;
int n;
printf("请输入一个大于1的整数:\n");
scanf_s("%d", &n);
while (i<n)
{
if (n % i == 0)
break;
else
i++;
}
if(i==n)
printf("%d是素数\n", n);
else
printf("%d不是素数\n", n);
return;
}
//最大公约数
void gys()
{
int a,b,num,temp;
printf("请输入两个数:\n");
scanf_s("%d%d", &a, &b);
if (a < b) {//4 12
temp = a; a = b; b = temp;
}
while (b != 0)
{
temp = a % b;
a = b;
b = temp;
}
printf("最大公约数为%d", a);
}
//数列求和
void add()
{
int sum=0;
int a[] = { 5,88,44,11,22,66,55 };
for (int i = 0; i < 7; i++)
{
sum = sum + a[i];
}
printf("数组元素的和为%d", sum);
}
//阶乘
void jiecheng()
{
int n; int sum = 1;
printf("请输入一个数:\n");
scanf_s(" %d", &n);
for (int i = 1; i <= n; i++)
{
sum = sum*i;
}
printf("%d的阶乘为%d", n, sum);
}
自己写的,很粗糙。