Classic Quick Sort
Page 1 of 1
Classic Quick Sort
1____void my_qsort(int* a, int N) {
2__________if (N <= 1) return;
3__________int l = 0;
4__________for (int i=1; i<N; i++)
5________________if (a[i] < a[0]) swap(a[++l], a[i]);
6__________swap(a[0], a[l]);
7__________my_qsort(a, l);
8__________my_qsort(a+l+1, N-l-1);
9____}
2__________if (N <= 1) return;
3__________int l = 0;
4__________for (int i=1; i<N; i++)
5________________if (a[i] < a[0]) swap(a[++l], a[i]);
6__________swap(a[0], a[l]);
7__________my_qsort(a, l);
8__________my_qsort(a+l+1, N-l-1);
9____}
viterbi- Posts : 32
Join date : 2011-09-03
Similar topics
» Complexity of Merge Sort, Buble Sort, Quick Sort
» Classic Heap Sort
» Classic Merge Sort
» Quick Sort in Java
» big array, can not put memory, how to sort external sort, and then merge
» Classic Heap Sort
» Classic Merge Sort
» Quick Sort in Java
» big array, can not put memory, how to sort external sort, and then merge
Page 1 of 1
Permissions in this forum:
You cannot reply to topics in this forum
|
|