InClass02/QuickSort.java at master · frekotj/InClass02 · 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
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
/*
Software Engineering -- Spring 2020
In Class 02
Description: Quick Sort
Team: Larisa Fava
*/

class QuickSort implements SortMethods
{
    int partition(int qs_arr[], int low, int high)
    {
        int pivot = qs_arr[high];
        int i = (low-1);
        for (int j=low; j<high; j++)
        {
            if (qs_arr[j] <= pivot)
            {
                i++;

                int temp = qs_arr[i];
                qs_arr[i] = qs_arr[j];
                qs_arr[j] = temp;
            }
        }

        int temp = qs_arr[i+1];
        qs_arr[i+1] = qs_arr[high];
        qs_arr[high] = temp;

        return i+1;
    }

    public void quick(int[] arr, int low, int high)
    {
        if (low < high)
        {

            int pi = partition(arr, low, high);

            quick(arr, low, pi-1);
            quick(arr, pi+1, high);
        }
    }

    @Override
    public void radix(int[] arr, int high, int low) {

    }

    @Override
    public void bubble(int[] arr, int high, int low) {

    }
}