Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- template <typename RECORD>
- void Array<RECORD>::quickSortAisde(Iterator first, Iterator last, const Iterator factor) {
- REKURENCJA_WEJSCIE
- if(last-first > factor){
- // podział tablicy (filtrowanie)
- Iterator mid = partitioningHoareLast(first, last);
- // sortowanie podtablic
- quickSortHoareFactor(first, mid-1, factor);
- quickSortHoareFactor(mid+1, last, factor);
- }
- //wejście na wyższy poziom rekurencji
- else REKURENCJA_WYJSCIE;
- }
- this->quickSortMoje(this->firstIndex(), this->lastIndex(),10);
- this->insertionSort(this->firstIndex(), this->lastIndex());
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement