sort

#include<stdio.h>
#include<stdlib.h>
#include<time.h> 
struct SortObject{
    int n;
    int * record;
};
typedef struct SortObject * Array;

void insertSort(Array a){
    int i,j;
    int temp;
    for(i=1;i<a->n;++i){
        temp=a->record[i];
        for(j=i-1;temp<a->record[j]&&j>=0;j--){
            a->record[j+1]=a->record[j];
        }
        if(j!=i-1){
            a->record[j+1]=temp;
        }
    }
}
void shellSort(Array a,int d){
    int i,j,inc;
    int temp;
    for(inc=d;inc>0;inc/=2){
        for(i=inc;i<a->n;i++){
            temp=a->record[i];
            for(j=i-inc;j>=0&&temp<a->record[j];j-=inc){
                a->record[j+inc]=a->record[j];
            }
            a->record[j+inc]=temp;
        }
    }
}
void selectSort(Array a){
    int i,j,k;
    int temp;
    for(i=0;i<a->n-1;i++){
        k=i;
        for(j=i+1;j<a->n;j++){
            if(a->record[j]<a->record[k]){
                k=j;
            }
        }
        if(k!=i){
            temp=a->record[i];
            a->record[i]=a->record[k];
            a->record[k]=temp;
        }
    }    
}
void bubbleSort(Array a){
    int i,j,noswap;
    int temp;
    for(i=0;i<a->n-1;i++){
        noswap=1;
        for(j=0;j<a->n-i-1;j++){
            if(a->record[j+1]<a->record[j]){
                temp=a->record[j];
                a->record[j]=a->record[j+1];
                a->record[j+1]=temp;
                noswap=0;
            }
        }
        if(noswap){
            break;
        }
    }    
}
void quickSort(Array a,int l,int r){
    int i,j;
    int temp;
    if(l>=r)return;
    i=l;j=r;temp=a->record[i];
    while(i!=j){
        while(i<j&&a->record[j]>=temp){
            j--;
        }
        if(i<j){
            a->record[i++]=a->record[j];
        }
        while(i<j&&a->record[i]<=temp){
            i++;
        }
        if(i<j){
            a->record[j--]=a->record[i];
        }
    }
    a->record[i]=temp;
    quickSort(a,l,i-1);
    quickSort(a,i+1,r);
}
void sift(Array a,int size,int p){
    int temp=a->record[p];
    int child=2*p+1;
    while(child<size){
        if((child<size-1)&&(a->record[child]<a->record[child+1])){
            child++;
        }
        if(temp<a->record[child]){
            a->record[p]=a->record[child];
            p=child;child=2*p+1;
        }
        else{
            break;
        }
    }
    a->record[p]=temp;
}
void heapSort(Array a){
    int i,n;
    int temp;
    n=a->n;
    for(i=n/2;i>=0;i--){
        sift(a,n,i);
    }
    for(i=n-1;i>0;i--){
        temp=a->record[0];
        a->record[0]=a->record[i];
        a->record[i]=temp;
        sift(a,i,0);
    }
}
void buildArray(Array a){
    int i;
    for(i=0;i<a->n;i++){
        a->record[i]=rand()%100+1;
        printf("%d,",a->record[i]);
    }
    printf("
");
}
void printArray(Array a){
    int i;
    for(i=0;i<a->n;i++){
        printf("%d,",a->record[i]);
    }
    printf("
");
    printf("
");
}

int main(){
    Array a=(Array)malloc(sizeof(struct SortObject));
    a->n=8;
    if(a!=NULL){
        a->record=(int *)malloc(sizeof(int)*a->n);
    }
    else{
        printf("out of space");
    }
    srand(time(NULL));
    printf("1.directInsertSort:
");
    buildArray(a);
    insertSort(a);
    printArray(a);
    printf("2.shellSort:
");
    buildArray(a);
    shellSort(a,a->n/2);
    printArray(a);
    printf("3.simpleSelectSort:
");
    buildArray(a);
    selectSort(a);
    printArray(a);
    printf("4.bubbleSort:
");
    buildArray(a);
    bubbleSort(a);
    printArray(a);
    printf("5.quickSort:
");
    buildArray(a);
    quickSort(a,0,a->n-1);
    printArray(a);
    printf("6.heapSort:
");
    buildArray(a);
    heapSort(a);
    printArray(a);
    return 0;
}