Java-Sort-Algorithms/ShakerSort.java at master · mattryanmtl/Java-Sort-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
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
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
import java.util.Random;


public class Shaker_Sort

{

    public static void printSequence(int[] sorted_sequence)

    {

        for (int i = 0; i < sorted_sequence.length; i++)

            System.out.print(sorted_sequence[i] + " ");

    }


    public static int[] shakerSort(int[] array) {

        for (int i = 0; i < array.length/2; i++) {

            boolean swapped = false;

            for (int j = i; j < array.length - i - 1; j++) {

                if (array[j] < array[j+1]) {

                    int tmp = array[j];

                    array[j] = array[j+1];

                    array[j+1] = tmp;

                }

            }

            for (int j = array.length - 2 - i; j > i; j--) {

                if (array[j] > array[j-1]) {

                    int tmp = array[j];

                    array[j] = array[j-1];

                    array[j-1] = tmp;

                    swapped = true;

                }

            }

            if(!swapped) break;

        }

        return array;

    }

    public static void main(String args[])

    {

        System.out

                .println("Sorting of randomly generated numbers using Shaker SORT");

        Random random = new Random();

        int N = 20;

        int[] sequence = new int[N];


        for (int i = 0; i < N; i++)

            sequence[i] = Math.abs(random.nextInt(100));


        System.out.println("\nOriginal Sequence: ");

        printSequence(sequence);


        System.out.println("\nSorted Sequence: ");

        printSequence(shakerSort(sequence));

    }


}