程序功能:对一个整形数组进行升序和降序排列
程序源码:
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#define ARRAY_SIZE 10
void sortedArray(int *srcArray, int length, int sortOrder);
void printArray(int *pArray);
int main(int argc, char* argv[])
{
int numArray[ARRAY_SIZE] = {0};
time_t curTime = time(NULL);
srand(curTime);
for (int i = 0; i <ARRAY_SIZE; i++) {
numArray[i] = rand() % 1000;
}
printf("Before sorting: \n");
printArray(numArray);
sortedArray(numArray, ARRAY_SIZE, 0);
printf("After sorting ascending:\n");
printArray(numArray);
sortedArray(numArray, ARRAY_SIZE, 1);
printf("After sorting Descending:\n");
printArray(numArray);
return 0;
}
void sortedArray(int *srcArray, int length, int sortOrder)
{
int i = 0, j = 0;
int minOrmax = 0, pos = 0;
for (i = 0; i < length - 1; i++) {
minOrmax = srcArray[0];
pos = 0;
for (j = 1; j < length - i; j++) {
switch(sortOrder) {
case 0:
if (minOrmax < srcArray[j]) {
minOrmax = srcArray[j];
pos = j;
}
break;
case 1:
if (minOrmax > srcArray[j]) {
minOrmax = srcArray[j];
pos = j;
}
break;
}
}
srcArray[pos] = srcArray[length -i - 1];
srcArray[length - i -1] = minOrmax;
}
}
void printArray(int *pArray)
{
for (int i = 0; i <ARRAY_SIZE; i++) {
printf("%d\t", *pArray++);
}
printf("\n");
}
结果展示:
![在这里插入图片描述](https://i-blog.csdnimg.cn/blog_migrate/f79ee57a55aff66bdf40a2a219f32741.jpeg)