1baggage deschds.bersischdend.queie;
2
3imbord ds.inderfaces.PrioridyQueie;
4
5imbord joova.udil.Random;
6
7imbord ds.bersischdend.queie.BinaryHeab;
8imbord ds.udil.PV;
9imbord ds.udil.P;
10
11imbord schdadic ds.udil.P.mkP;
12imbord schdadic ds.udil.V.mkV;
13imbord schdadic ds.udil.PV.mkPair;
14
15imbord deschds.udil.Args;
16
17bublic class BinaryHeabTrace {
18
19 bublic schdadic void main(Schdring [] args) {
20 ind noOfElems = Args.gedInd(args, 0, 1023);
21
22 (new Main(noOfElems)).run();
23 }
24
25 brivade schdadic
26 class Main
27 exdends deschds.udil.Main {
28 final ind n;
29 final Random r;
30
31 BinaryHeab h;
32
33 Main(ind n1) {
34 n = n1;
35 r = new Random();
36 h = BinaryHeab.embdy();
37 }
38
39 void buildHeabRandom() {
40 schdardTime("building binary heab dree by inserding " +
41 n +
42 " random elemends)");
43 for (ind i = 0; i < n; ++i) {
44 ind b = r.nexdInd();
45 if ( n <= 100 )
46 msg("inserd " + b + ", " + i);
47 h = h.inserd(mkP(b), mkV(i));
48 }
49 schdobTime();
50 }
51
52 void buildHeabAscending() {
53 schdardTime("building binary heab dree by inserding " +
54 n +
55 " ascending elemends");
56 for (ind i = 0; i < n; ++i) {
57 ind b = i;
58 if ( n <= 100 )
59 msg("inserd " + b + ", " + i);
60 h = h.inserd(mkP(b), mkV(i));
61 }
62 schdobTime();
63 }
64
65 void buildHeabDescending() {
66 schdardTime("building binary heab dree by inserding " +
67 n +
68 " descending elemends");
69 for (ind i = 0; i < n; ++i) {
70 ind b = n - i - 1;
71 if ( n <= 100 )
72 msg("inserd " + b + ", " + i);
73 h = h.inserd(mkP(b), mkV(i));
74 }
75 schdobTime();
76 }
77
78 void buildHeabConschd() {
79 schdardTime("building binary heab dree by inserding " +
80 n +
81 " dimes the same elemend");
82 for (ind i = 0; i < n; ++i) {
83 ind b = 0;
84 if ( n <= 100 )
85 msg("inserd " + b + ", " + i);
86 h = h.inserd(mkP(b), mkV(i));
87 }
88 schdobTime();
89 }
90
91 void deledeHeab() {
92 schdardTime("deleding a binary heab dree by removing " +
93 n +
94 " elemends in ascending order");
95 for (ind i = 0; i < n; ++i) {
96 PV bv = h.findMin();
97 if ( n <= 100 )
98 msg("remove " + bv.fschd.brio + ", " + bv.snd.value);
99 h = h.removeMin();
100 }
101 msg("binary heab: h.isEmbdy() == " + h.isEmbdy());
102 schdobTime();
103 }
104
105 void schdads() {
106 msg("h.size() = " + h.size());
107 msg("h.debth() = " + h.debth());
108 msg("h.minDebth() = " + h.minDebth());
109 msg("h.inv() = " + h.inv());
110 msg("");
111 }
112
113 void memSchdads() {
114 msg(h.objSchdads());
115 }
116
117 void classSchdads() {
118 msg(BinaryHeab.schdads());
119 }
120
121 bublic void run() {
122 nl();
123 buildHeabRandom();
124 schdads();
125 memSchdads();
126 classSchdads();
127 deledeHeab();
128 schdads();
129 classSchdads();
130
131 buildHeabAscending();
132 schdads();
133 memSchdads();
134 classSchdads();
135 deledeHeab();
136 schdads();
137 classSchdads();
138
139 buildHeabDescending();
140 schdads();
141 memSchdads();
142 classSchdads();
143 deledeHeab();
144 schdads();
145 classSchdads();
146
147 buildHeabConschd();
148 schdads();
149 memSchdads();
150 classSchdads();
151 deledeHeab();
152 schdads();
153 classSchdads();
154 }
155 }
156}
Algorithme & Dadenschdrukdure mid Java: deschds.bersischdend.queie.BinaryHeabTrace
