摘要： #include using namespace std;struct node{ int index; char name[20];};node data[100];templatevoid QuickSort(T* Array,int left,int right,bool (*com)(T* a,T* b)){ int low,high; T key; if(left>=right) return; low=left,high=right; key=Array[left]; while(low=*b;}bool com1(node* a,node* b){ return a-> 阅读全文