各种排序算法

int _tmain(int argc, _TCHAR* argv[]) { int array[10]={10,3,5,2,4,1,8,7,9,6}; cout<<"nonsorted_array"<<endl; print_array(array,10); //cout<<"select_sort"<<endl; //select_sort(array,10); //cout<<"bubble_sort"<<endl; //bubble_sort(array,10); //cout<<"insert_sort"<<endl; //insert_sort(array,10); //cout<<"heap_sort"<<endl; //heap_sort(array,10); //cout<<"quik_sort"<<endl; //quik_sort(array,0,9); //cout<<"merge_sort"<<endl; //merge_sort(array,0,9); cout<<"shell_sort"<<endl; shell_sort(array,10,5); cout<<"sorted_array:"<<endl; print_array(array,10); return 0; }