对于整数的处理（最小的与第一个交换，最大的与最后一个交换）

#include<stdio.h>
int main()
{
void input(int *pt, int number);
void print(int *pt, int number);
void process(int *pt, int number);
int a[10];
int *p = a;
int n = 5;
printf("enter %d numbers:\n", n);
input(p, n);
process(p, n);
printf("the result is :\n");
print(p, n);
return 0;
}
void input(int *pt, int number)
{
for (int i = 0; i < number; i++)
scanf_s("%d", pt + i);
}
void process(int *pt, int number)
{
int min;
int i;
int count=0;
min = *pt;
for (i = 0; i < number; i++)
{
if (min > *(pt + i ))
{
min = *(pt + i );
count++;
}

}
*(pt + count) = *pt;
*pt = min;


int max;
int j;
int count1 = 0;
max = *pt;
for (j = 0; j < number; j++)
{
if (max < *(pt + j))
{
max = *(pt + j);
count1++;
}
}

*(pt + count1) = *(pt + number - 1);
*(pt+number-1) = max;
}
void print(int *pt, int number)
{
for (int i = 0; i < number; i++)
printf("%d ", *(pt + i));
printf("\n");
}