SortingAlgorithms/OddEvenSort.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
60
61
62
63
import java.util.Arrays;

public class OddEvenSort {

    String complexity;

    OddEvenSort() {

        complexity = ". Quadratic Time Complexity.";

    }

    void sort(int[] sortArray) {

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

        boolean needsSorting = true;

        while (needsSorting) {

            needsSorting = false;
            int tempInt;

            for (int count = 1; count <= sortArray.length - 2; count+=2) {

                if (sortArray[count] > sortArray[count + 1]) {

                    tempInt = sortArray[count];
                    sortArray[count] = sortArray[count + 1];
                    sortArray[count + 1] = tempInt;

                    needsSorting = true;
                }

            }

            for (int count = 0; count <= sortArray.length - 2; count+= 2) {

                if (sortArray[count] > sortArray[count + 1]) {

                    tempInt = sortArray[count];
                    sortArray[count] = sortArray[count + 1];
                    sortArray[count + 1] = tempInt;

                    needsSorting = true;
                }

            }

        }

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

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

    }
}