集中几种排序算法 C语言版【未完成】

#include <stdio.h>
#include <stdlib.h>

/* run this program using the console pauser or add your own getch, system("pause") or input loop */
int ArrayCopy(int sc[], int dest[] ,int n) {
	int i;
	for(i = 0; i < n; i++){
		dest[i] = sc[i];
	}
	return 1;
}
int QuickSortOnece(int data[],int start, int end){
	int i= start, j = end, guard = data[start], dere = 0;
	while(i != j){
		if(dere == 0){
			if(data[j] > guard){
				j++;
			}
			else{
				data[i] = data[j];
				i++;
			}
			
		} 
		
	}	
}

void QuickSort(int data[],int n){
	
} 

int ShowArray(int sc[],int n) {// 
	int i;
	for(i = 0; i < n; i++){
		printf("%5d",sc[i]);
	}
	printf("\n");
	return 1;
}
int main(int argc, char *argv[]) {
	int a[]= {49, 38, 65, 97, 76, 13, 27, 49, 55, 04};
	int b[10];
	ArrayCopy(a , b, 10);
	ShowArray(b,10);	
	
	return 0;
}