C:/Users/duhem/Desktop/FoRTReSS/FoRTReSS/FoRTReSS/src/sort.h

Go to the documentation of this file.

#ifndef SORT_H
#define SORT_H

#include "RZ.h"
#include <cstdlib>

void quickSort(vector<RZ> &vec, int begin, int end) {

        if(begin < end) {

                int left = begin - 1;
                int right = end + 1;
                // Random pivot
                //int pivot = (rand() % (end - begin + 1)) + begin;
                int pivot = (end - begin - 1) + begin;
                int pivotVal = vec.at(pivot).getRZCost();

                while(1) {
                        do right--; while(vec.at(right).getRZCost() > pivotVal);
                        do left++; while(vec.at(left).getRZCost() < pivotVal);

                        if(left < right) {
                                // Swap
                                RZ rztmp(vec.at(left));
                                vec[left] = vec.at(right);
                                vec[right] = rztmp;
                        } else break;
                }

                // Sort sub-vectors
                quickSort(vec, begin, right);
                quickSort(vec, right + 1, end);
        }
}

#endif