editdlg.cpp

六种排序算法的比较 冒泡排序

// EditDlg.cpp : implementation file
//

#include "stdafx.h"
#include "MFC.h"
#include "EditDlg.h"

#ifdef _DEBUG
#define new DEBUG_NEW
#undef THIS_FILE
static char THIS_FILE[] = __FILE__;
#endif

/////////////////////////////////////////////////////////////////////////////
// CEditDlg dialog


CEditDlg::CEditDlg(CWnd* pParent /*=NULL*/)
	: CDialog(CEditDlg::IDD, pParent)
{
	//{{AFX_DATA_INIT(CEditDlg)
		// NOTE: the ClassWizard will add member initialization here
	//}}AFX_DATA_INIT
}


void CEditDlg::DoDataExchange(CDataExchange* pDX)
{
	CDialog::DoDataExchange(pDX);
	//{{AFX_DATA_MAP(CEditDlg)
	DDX_Control(pDX, IDC_ANSWER, m_answer);
	//}}AFX_DATA_MAP
}

BOOL CEditDlg::OnInitDialog()
{
	CDialog::OnInitDialog();
	m_answer.SetExtendedStyle(LVS_EX_FULLROWSELECT | LVS_EX_GRIDLINES);
	m_answer.SetTextBkColor(RGB(200,100,200));
	m_answer.InsertColumn(0,"序列",LVCFMT_LEFT,60);
	m_answer.InsertColumn(1,"比较",LVCFMT_LEFT,80);
	m_answer.InsertColumn(2,"直接插入排序",LVCFMT_LEFT,120);
	m_answer.InsertColumn(3,"简单选择排序",LVCFMT_LEFT,120);
	m_answer.InsertColumn(4,"冒泡排序",LVCFMT_LEFT,80);
	m_answer.InsertColumn(5,"希尔排序",LVCFMT_LEFT,80);
	m_answer.InsertColumn(6,"快速排序",LVCFMT_LEFT,80);
	m_answer.InsertColumn(7,"堆排序",LVCFMT_LEFT,60);
	for(int i = 0;i < 3;i++)
	{
		m_answer.InsertItem(2*i,shuzu[0]);
		m_answer.SetItemText(2*i,1,jilu[0]);
		int j = 0;
		for(j = 1;j <= 6;j++)
			m_answer.SetItemText(2*i,j+1,result[i][0][j]);
		m_answer.InsertItem(2*i+1,"");
		m_answer.SetItemText(2*i+1,1,jilu[1]);
		for(j = 1;j <= 6;j++)
			m_answer.SetItemText(2*i+1,j+1,result[i][1][j]);
	}

	return true;
}

BEGIN_MESSAGE_MAP(CEditDlg, CDialog)
	//{{AFX_MSG_MAP(CEditDlg)
	//}}AFX_MSG_MAP
END_MESSAGE_MAP()

/////////////////////////////////////////////////////////////////////////////
// CEditDlg message handlers

void CEditDlg::OnOK() 
{
	// TODO: Add extra validation here
	
	CDialog::OnOK();
}