Java-Sort-Algorithms/StoogeSort.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
import java.util.Random;


public class Stooge_Sort

{


    public static int N = 20;

    public static int[] sequence = new int[N];


    public static int[] stoogeSort(int[] L, int i, int j)

    {

        if (L[j] < L[i])

        {

            int swap = L[i];

            L[i] = L[j];

            L[j] = swap;

        }

        if ((j - i + 1) >= 3)

        {

            int t = (j - i + 1) / 3;

            stoogeSort(L, i, j - t);

            stoogeSort(L, i + t, j);

            stoogeSort(L, i, j - t);

        }

        return L;

    }


    public static void printSequence(int[] sorted_sequence)

    {

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

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

    }


    public static void main(String[] args)

    {

        Random random = new Random();

        System.out

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


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

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


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

        printSequence(sequence);


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

        printSequence(stoogeSort(sequence, 0, sequence.length - 1));

    }

}