C经典算法之选择、插入、气泡排序

#include <stdio.h> 
#include <stdlib.h> 
#include <time.h> 
#define MAX 10 
#define SWAP(x,y) {int t; t = x; x = y; y = t;} 

void selsort(int[]);  // 选择排序 
void insort(int[]);   // 插入排序 
void bubsort(int[]);  // 气泡排序 

int main(void) {  
    int number[MAX] = {0}; 
    int i;  

    srand(time(NULL)); 

    printf("排序前："); 
    for(i = 0; i < MAX; i++) { 
        number[i] = rand() % 100; 
        printf("%d ", number[i]); 
    } 

    printf("\n请选择排序方式：\n"); 
    printf("(1)选择排序\n(2)插入排序\n(3)气泡排序\n:"); 
    scanf("%d", &i); 

    switch(i) { 
        case 1: 
            selsort(number); break; 
        case 2: