BinarySort/BinaryShortVisulizer.java at master · bhadrik/BinarySort · 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
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
import org.algorithm_visualizer.*;
import java.util.Arrays;

public class Main {
    private static ChartTracer chartTracer = new ChartTracer("Chart");
    private static LogTracer logTracer = new LogTracer("Console");
    private static Integer [] data = (Integer[]) new Randomize.Array1D(15, new Randomize.Integer(1, 20)).create();

    public static void main(String[] args) {
        int length = data.length, bitNo = 6,lowerBound = 0;
        int upperBound = length - 1;

        logTracer.printf("Input data = %s\n",Arrays.toString(data));
        chartTracer.set(data);
        Layout.setRoot(new VerticalLayout(new Commander[]{chartTracer, logTracer}));
        Tracer.delay();

        // binaryOfAllNumbers();

        binarySort(data, bitNo-1, lowerBound, upperBound);

        logTracer.printf("sorted data = %s\n",Arrays.toString(data));
    }

    private static void binarySort(Integer [] data, int bitNo, int lowerBound, int upperBound) {
        // logTracer.reset();
        logTracer.printf("scanning bitNo:%s for (%s, %s)\n", bitNo, lowerBound, upperBound);
        chartTracer.set(data);
        chartTracer.deselect(0, 14);
        chartTracer.select(lowerBound, upperBound);
        Tracer.delay();

        int l_backup = lowerBound, u_backup = upperBound, i, k;
        boolean letsGo = false;

        // for(int f=bitNo; f>-1; f--){
        //     logTracer.printf("%s: ",f);
        //     for(k = 0; k < 15; k++){
        //         int tempo = (data[k] >> f) & 1;
        //         logTracer.printf("%s ",tempo);
        //     }
        //     logTracer.printf("\n");
        // }


        do{
            //Scaning all the numbers between index "lowerBound" to "upperBound"
            boolean isBitNoPrinted = false;
            for (i = l_backup; i <= upperBound; i++) {
                // int temp = (data[i] >> bitNo) & 1;
                boolean condition = ((data[i] >> bitNo) & 1) >= 1 ? true:false;

                if (condition) {
                    letsGo = true;
                    if (i != upperBound) {
                        // logTracer.printf("swap %s and %s\n",data[i],data[upperBound]);

                        swap(data, i, upperBound);
                        if(!isBitNoPrinted){
                            for(k = 0; k < 15; k++){
                                int tempo = (data[k] >> bitNo) & 1;
                                logTracer.printf("%s ",tempo);
                            }

                            isBitNoPrinted = true;
                            logTracer.printf("\n");
                        }

                        // chartTracer.set(data);
                        // chartTracer.select(lowerBound, upperBound);
                        Tracer.delay();
                        i--;
                    }
                    chartTracer.deselect(upperBound);
                    upperBound--;
                }
            }

            bitNo--;
            isBitNoPrinted = false;
            if(!letsGo)
            logTracer.printf("scanning bitNo:%s\n",bitNo);
        }while(!letsGo && bitNo > 0);

        bitNo++;

        int hold = upperBound;

        if (upperBound == u_backup){
            hold = lowerBound;
        }
        else{
            hold = upperBound + 1;
        }

        for(k = 0; k < 15; k++){
            int tempo = (data[k] >> bitNo) & 1;
            logTracer.printf("%s ",tempo);
        }
        logTracer.printf("\n");

        logTracer.printf("Devide array into 2 groups");
        logTracer.printf("(%s,%s) (%s,%s)\n", lowerBound, upperBound, hold, u_backup);
        Tracer.delay();

        //Again calling for divided subarry, and now for (bitNo - 1)th bit
        if(bitNo > 0 && (hold != u_backup || lowerBound != upperBound)){
            binarySort(data, (bitNo - 1), hold, u_backup);
            binarySort(data, (bitNo - 1), lowerBound, upperBound);
        }
    }

    private static void swap(Integer [] data, int x, int y) {
        if(x == y) return;
        int temp = data[x];
        data[x] = data[y];
        data[y] = temp;

        chartTracer.patch(x, data[y]);
        chartTracer.patch(y, data[x]);
        Tracer.delay();
        chartTracer.patch(x, data[x]);
        chartTracer.patch(y, data[y]);
        Tracer.delay();
        chartTracer.depatch(x);
        chartTracer.depatch(y);
    }

    private static void binaryOfAllNumbers(){
        for(int i=0; i<data.length; i++){
            logTracer.printf("%s [",data[i]);
            for(int bit=5; bit>=0; bit--){
                logTracer.printf(" %s",(data[i] >> bit) & 1);
            }
            logTracer.printf("]\n");
        }
    }
}