Insertion(m_fData, m_nSize, time);
}
else if(iRadio == IDC_BIINSERTIONSORT)
{
BiInsertion(m_fData, m_nSize,time);
}
else if(iRadio == IDC_TREESORT)
{
TreeSelection(m_fData,m_nSize,time);
}
}
void CChooseView::Quick(float *array,int size, int time) // 快速排序法
{
CMainFrame *pwnd = ( CMainFrame* )AfxGetMainWnd();
CarithmeticView *pari = ( CarithmeticView* )( pwnd->m_wndSplitter3.GetPane(0, 0 ) );
long L,M,R;
pari->m_List.SetCurSel(1);
pari->UpdateWindow();
Sleep(time);
float pivot,temp;
pari->m_List.SetCurSel(2);
pari->UpdateWindow();
Sleep(time);
L=0,R=size-1,M=(L+R)/2;
pari->m_List.SetCurSel(3);
pari->UpdateWindow();
Sleep(time);
pivot=array[M];
pari->m_List.SetCurSel(4);