u012688042的专栏

c++插入排序 void InsertSort(int *arr, int n) { if (!arr || n <= 1) return; for (int i=2; i<n; ++i) { int tmp = arr[i]; int j=i; for (; j>0; --j) { if (tmp > arr[j-1]) { a...

void PrintArr(int *arr, int n) { if (!arr || n <= 0 ) return; for (int i=0; i<n; ++i) { std::cout << arr[i] << " "; } std::cout << std::endl; return; } void Merge(int ...

快速排序 // An highlighted block void _QuickSort(int *data, int left, int right) { if (left >= right) { return; } int pick_index = RandomPick(left, right); int pick_data = data[pick_index]; d...