SortingAlgorithms/BubbleSort.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
import java.util.Arrays;

public class BubbleSort {

    String complexity;

    BubbleSort() {

        complexity = ". Quadratic Time Complexity.";

    }

    void sort(int[] sortArray) {

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

        int tempInt;

        for (int count = sortArray.length - 1; count > 0; count--) {

            for (int countTwo = 0; countTwo < count; countTwo++) {

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

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

                }
            }
        }

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

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

}