39 lines
862 B
C
39 lines
862 B
C
|
/* sort.c
|
||
|
|
|
||
|
|
Test program to sort a large number of integers.
|
||
|
|
|
||
|
|
Intention is to stress virtual memory system.
|
||
|
|
|
||
|
|
Ideally, we could read the unsorted array off of the file
|
||
|
|
system, and store the result back to the file system! */
|
||
|
|
#include <stdio.h>
|
||
|
|
|
||
|
|
/* Size of array to sort. */
|
||
|
|
#define SORT_SIZE 128
|
||
|
|
|
||
|
|
int
|
||
|
|
main (void)
|
||
|
|
{
|
||
|
|
/* Array to sort. Static to reduce stack usage. */
|
||
|
|
static int array[SORT_SIZE];
|
||
|
|
|
||
|
|
int i, j, tmp;
|
||
|
|
|
||
|
|
/* First initialize the array in descending order. */
|
||
|
|
for (i = 0; i < SORT_SIZE; i++)
|
||
|
|
array[i] = SORT_SIZE - i - 1;
|
||
|
|
|
||
|
|
/* Then sort in ascending order. */
|
||
|
|
for (i = 0; i < SORT_SIZE - 1; i++)
|
||
|
|
for (j = 0; j < SORT_SIZE - 1 - i; j++)
|
||
|
|
if (array[j] > array[j + 1])
|
||
|
|
{
|
||
|
|
tmp = array[j];
|
||
|
|
array[j] = array[j + 1];
|
||
|
|
array[j + 1] = tmp;
|
||
|
|
}
|
||
|
|
|
||
|
|
printf ("sort exiting with code %d\n", array[0]);
|
||
|
|
return array[0];
|
||
|
|
}
|