冒泡排序法
摘要:
冒泡排序很简单,在这里就不说明原理了,直接上代码。void BubbleSort(unsigned long * lstNum, size_t nSize){ unsigned long nTemp; for (unsigned int i = 0; i < nSize; i++) for (unsigned int j = nSize - 1; j > i; j--) { if (lstNum[j] < lstNum[j - 1]) { nTemp = lstNum[j - 1]... 阅读全文
posted @ 2012-05-10 04:18 zimmerk 阅读(292) 评论(0) 推荐(0) 编辑