void C排序性能测试Dlg::OnBnClickedButton1() //正序排序
{
} UpdateData(true); //更新数据 N=MAX+1; UpdateData(false); long *r=new long[N]; long*r1=new long[N]; for(long i=1;i<N;i++) r[i]=i; UpdateData(true); Insert1=InsertSort(r,N-1); //插入排序 move11=compare;com11=move; //移动和比较次数 Shell1=ShellInsert(r,N-1); //希尔排序 move21=move;com21=compare; Bubble1=BubbleSort(r,N-1); //起泡排序 move31=move;com31=compare; compare=0;move=0; Qsort1=QSORT(r,0,N-1); //快速排序 move41=move;com41=compare; Select1=SelectSort(r,N-1); //选择排序 move51=move;com51=compare; compare=0;move=0; Heap1=Heapsort(r,N-1); //堆排序 move61=move;com61=compare; Merge1=MergeSort(r,r1,N-1); //归并排序 move71=move;com71=compare; UpdateData(false); delete r; delete r1;
2.3.2.1添加数据更新所需编辑框
温馨提示:答案为网友推荐,仅供参考