常用排序算法的动态演示系统

程序清单

常用排序算法的动态演示系统的开发

void CChooseView::drawCode(int time)

{

CMainFrame *pwnd = ( CMainFrame* )AfxGetMainWnd();

CarithmeticView *pari = ( CarithmeticView* )( pwnd->m_wndSplitter3.GetPane(0, 0 ) );

CView *view = pwnd->GetActiveView();

int i;

pari->m_List.SetCurSel(1);

pari->UpdateWindow();

Sleep(time);

float temp;

pari->m_List.SetCurSel(2);

pari->UpdateWindow();

Sleep(time);

for(int pass=1;pass<size;pass++) //共比较 size-1 轮

{

Sleep(time);

int j=0;

pari->m_List.SetCurSel(5);//int j=0;

pari->UpdateWindow();

//pari->UpdateWindow();

Sleep(time);

for(i=0;i<size-pass;i++) //比较一轮

{

drawCircle(i);

pari->m_List.SetCurSel(6);//for2(

Sleep(time);

if(m_fData[i]>m_fData[i+1]) //相邻两数比较，大数下沉

{

pari->m_List.SetCurSel(8);//{

pari->UpdateWindow();

Sleep(time);

temp=m_fData[i];

pari->m_List.SetCurSel(9);//temp=

pari->UpdateWindow();

Sleep(time);

pari->UpdateWindow();

pari->m_List.SetCurSel(12);//j++

Sleep(time);

}

pari->m_List.SetCurSel(13);//}if

pari->UpdateWindow();

}

pari->m_List.SetCurSel(14);//}if==

pari->UpdateWindow();

Sleep(time);

break;

Sleep(time);

pari->UpdateWindow();

Sleep(time);

}

pari->m_List.SetCurSel(16);//for1}

pari->UpdateWindow();

Sleep(time);

drawCircle(m_nSize - 1);

return;

{

Insertion(m_fData, m_nSize, time);

}

else if(iRadio == IDC_BIINSERTIONSORT)

BiInsertion(m_fData, m_nSize,time);

}

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;

Sleep(time);

L=0,R=size-1,M=(L+R)/2;