选择排序

#include <stdio.h>
#include <math.h>
#define MAX_SIZE 101
#define SWAP(x,y,t) ((t) = (x) ,(x) = (y), (y) = (t))

void sort (int[],int);/* selection sort */
void mainStream();

int main(int argc, const char * argv[])
{

    // insert code here...
    printf("Hello, World!\n");
    mainStream();
    return 0;
}

void mainStream(){
    int i,n;
    int list[MAX_SIZE];
    printf("ENTER THE NUMBERS OF GENERATE : ");
    scanf("%d",&n);
    if (n<1 || n>MAX_SIZE ) {
        fprintf(stderr, "Improper value of n\n");
        exit(1);
    }
    for (i=0; i<n; i++) {/* randomly generate numbers */
        list[i] = rand() % 1000;
        printf("%d ",list[i]);
    }
    sort(list, n);
    printf("\n Sorted array :\n");
    for (i=0; i<n; i++) {/* print out sorted numbers */

        printf("%d ",list[i]);
    }
    printf("\n");
    
}
void sort(int list[],int n){
    //对给定数组，按照非递减排序，数组list长度为n；
    int i,j = 0,min,temp;
    for (i=0; i<n-1; i++) {
        min = i;
        for (j=i+1; j<n; j++) {
            if (list[j] < list[min]) {
                min = j;
            }
        }
        
        SWAP(list[i], list[min], temp);
    }
}
//void swap(&x,)