排序算法(插入、选择、归并、冒泡、堆排序)实现代码C++

//main.cpp // #include "sort.h" #include "heapsort.h" int main() { int A[14] = {27, 17, 3, 16, 13, 10, 1, 5, 7, 12, 4, 8, 9, 0}; int* p = &A[0]; // //Insert_Sort_Ascending(p, 14); //插入排序 //Selection_Sort_Ascending(p, 14); //选择排序 //Bubble_Sort_Ascending(p, 0, 14); //冒泡排序 //Merge_Sort_Ascending(p, 0, 13); //归并排序 //Heap_Sort(p, 14); //堆排序 // for (int i=0; i<14; i++) { cout<<A[i]<<","; } // int a; cin>>a; return 0; }