摘要:
void QuickSort::QuickSort_Sort(int low,int high){ int Pivot_Key=Int_Vector[low],i=low,j=high; while(i<j) { while(i<j&&Int_Vector[j]>=Pivot_Key) { j--; } if(i<j) { Swap_Value(I... 阅读全文
摘要:
#include "StdAfx.h"#include "HeapSort.h"void Swap_Value(int &lhs,int &rhs);HeapSort::HeapSort(void){}HeapSort::~HeapSort(void){}void HeapSort::Heap_Sort_Init(std::vector<int> _Int_Vector... 阅读全文
摘要:
#include "StdAfx.h"#include "MergeSort.h"typedef vector<int> IntDefVector;MergeSort::MergeSort(void){}MergeSort::~MergeSort(void){}void MergeSort::MergeSort_Ini(std::vector<int> _Int_Vecto... 阅读全文
摘要:
from:http://www.cnblogs.com/architect/archive/2009/05/06/1450489.html//归并排序中之并//Updatedbyzivsoftat05/06/2009int*Merge(int*a,intaLength,int*b,intbLength){//合并结果指针int*result;//初始化结果指针result=newint[aLeng... 阅读全文