Database-Technology-Algorithms/QuickSort.inl at master · syfantid/Database-Technology-Algorithms · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
#include "QuickSort.h"
#include <algorithm>

template<class T>
QuickSort<T>::QuickSort(T *a,int n)
{
    /*QuickSort(a, 0, n-1)
    What do you mean by this? This function does not exist...
    */
}

template<class T>
void quickSort(T a[],int l,int r)
{
    std::sort(a + l, a + r);
    return;
  /*  if (l>= r) return ;
    int i=l,
        j=r+1;
    T pivot = a[1];
    while (true)
    {
        do
        {
            i=i+1;
        }while (a[i]<pivot);
        do
        {
            j=j-1;
        }while(a[j]>pivot);
        if (i>=j) break;
        //Swap
    }
*/
}