SortingAlgorithms/StoogeSort.java at master · Cselwood/SortingAlgorithms · 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
55
56
57
58
59
import java.util.Arrays;

public class StoogeSort {

    String complexity;

    StoogeSort() {

        complexity = ". O(nlog 3/log 1.5) Complexity.";

    }

    void sort(int[] sortArray) {

        /*
        Begin Time Start
         */
        double start = (double) System.nanoTime();

        // Recursive sort, reminiscent of bubble sort
        stoogeSort(sortArray);

        /*
        End Time
         */
        double end = (double) System.nanoTime();

        System.out.println("StoogeSort: " + Arrays.toString(sortArray) + complexity + " Seconds taken was " + ((end - start) / 1000000));
    }

    void stoogeSort(int[] sortArray) {

        stoogeSort(sortArray, 0, (sortArray.length - 1));

    }

    void stoogeSort(int[] sortArray, int first, int last) {

        if (sortArray[last] < sortArray[first]) {

            int tempInt = sortArray[first];
            sortArray[first] = sortArray[last];
            sortArray[last] = tempInt;

        }

        if ((last - first) >  1) {

            int tempInt = (last - first + 1) / 3;

            stoogeSort(sortArray, first, (last - tempInt));
            stoogeSort(sortArray, (first + tempInt), last);
            stoogeSort(sortArray, first, (last - tempInt));

        }

    }

}