Skip to content

Commit 0f5ef4d

Browse files
kdgyunkdgyun
committed
typo fix
1 parent 00bc1ad commit 0f5ef4d

2 files changed

Lines changed: 19 additions & 19 deletions

File tree

‎SortingAlgorithm/Java/BitonicSort/BitonicSort.java‎

Lines changed: 10 additions & 10 deletions
Original file line numberDiff line numberDiff line change
@@ -24,7 +24,7 @@ final private static int greatestPowerOfTwoLessThan(int n) {
2424
while(k > 0 && k < n) {
2525
k <<= 1;
2626
}
27-
return k >> 1;
27+
return k >>> 1;
2828
}
2929

3030
//============= primitive type ============//
@@ -40,7 +40,7 @@ public static void sort(byte[] a) {
4040

4141
private static void sort(byte[] a, int lo, int len, boolean dir) {
4242
if(len > 1) {
43-
int mid = (len >> 1);
43+
int mid = (len >>> 1);
4444
sort(a, lo, mid, !dir);
4545
sort(a, lo + mid, len - mid, dir);
4646
merge(a, lo, len, dir);
@@ -82,7 +82,7 @@ public static void sort(char[] a) {
8282

8383
private static void sort(char[] a, int lo, int len, boolean dir) {
8484
if(len > 1) {
85-
int mid = (len >> 1);
85+
int mid = (len >>> 1);
8686
sort(a, lo, mid, !dir);
8787
sort(a, lo + mid, len - mid, dir);
8888
merge(a, lo, len, dir);
@@ -123,7 +123,7 @@ public static void sort(short[] a) {
123123

124124
private static void sort(short[] a, int lo, int len, boolean dir) {
125125
if(len > 1) {
126-
int mid = (len >> 1);
126+
int mid = (len >>> 1);
127127
sort(a, lo, mid, !dir);
128128
sort(a, lo + mid, len - mid, dir);
129129
merge(a, lo, len, dir);
@@ -164,7 +164,7 @@ public static void sort(int[] a) {
164164

165165
private static void sort(int[] a, int lo, int len, boolean dir) {
166166
if(len > 1) {
167-
int mid = (len >> 1);
167+
int mid = (len >>> 1);
168168
sort(a, lo, mid, !dir);
169169
sort(a, lo + mid, len - mid, dir);
170170
merge(a, lo, len, dir);
@@ -204,7 +204,7 @@ public static void sort(long[] a) {
204204

205205
private static void sort(long[] a, int lo, int len, boolean dir) {
206206
if(len > 1) {
207-
int mid = (len >> 1);
207+
int mid = (len >>> 1);
208208
sort(a, lo, mid, !dir);
209209
sort(a, lo + mid, len - mid, dir);
210210
merge(a, lo, len, dir);
@@ -244,7 +244,7 @@ public static void sort(float[] a) {
244244

245245
private static void sort(float[] a, int lo, int len, boolean dir) {
246246
if(len > 1) {
247-
int mid = (len >> 1);
247+
int mid = (len >>> 1);
248248
sort(a, lo, mid, !dir);
249249
sort(a, lo + mid, len - mid, dir);
250250
merge(a, lo, len, dir);
@@ -283,7 +283,7 @@ public static void sort(double[] a) {
283283

284284
private static void sort(double[] a, int lo, int len, boolean dir) {
285285
if(len > 1) {
286-
int mid = (len >> 1);
286+
int mid = (len >>> 1);
287287
sort(a, lo, mid, !dir);
288288
sort(a, lo + mid, len - mid, dir);
289289
merge(a, lo, len, dir);
@@ -324,7 +324,7 @@ public static void sort(Object[] a) {
324324

325325
private static void sort(Object[] a, int lo, int len, boolean dir) {
326326
if(len > 1) {
327-
int mid = (len >> 1);
327+
int mid = (len >>> 1);
328328
sort(a, lo, mid, !dir);
329329
sort(a, lo + mid, len - mid, dir);
330330
merge(a, lo, len, dir);
@@ -370,7 +370,7 @@ public static <T> void sort(T[] a, Comparator<? super T> c) {
370370

371371
private static <T> void sort(T[] a, int lo, int len, boolean dir, Comparator<? super T> c) {
372372
if(len > 1) {
373-
int mid = (len >> 1);
373+
int mid = (len >>> 1);
374374
sort(a, lo, mid, !dir, c);
375375
sort(a, lo + mid, len - mid, dir, c);
376376
merge(a, lo, len, dir, c);

‎SortingAlgorithm/Java/IntroSort/IntroSort.java‎

Lines changed: 9 additions & 9 deletions
Original file line numberDiff line numberDiff line change
@@ -70,7 +70,7 @@ private static void __heapSort(byte[] a, int lo, int hi) {
7070
return;
7171
}
7272
int last = hi - 1;
73-
int parent = ((last - 1) >> 1);
73+
int parent = ((last - 1) >>> 1);
7474

7575
while(parent >= lo) {
7676
__heapify(a, parent, last);
@@ -188,7 +188,7 @@ private static void __heapSort(char[] a, int lo, int hi) {
188188
return;
189189
}
190190
int last = hi - 1;
191-
int parent = ((last - 1) >> 1);
191+
int parent = ((last - 1) >>> 1);
192192

193193
while(parent >= lo) {
194194
__heapify(a, parent, last);
@@ -308,7 +308,7 @@ private static void __heapSort(short[] a, int lo, int hi) {
308308
return;
309309
}
310310
int last = hi - 1;
311-
int parent = ((last - 1) >> 1);
311+
int parent = ((last - 1) >>> 1);
312312

313313
while(parent >= lo) {
314314
__heapify(a, parent, last);
@@ -428,7 +428,7 @@ private static void __heapSort(int[] a, int lo, int hi) {
428428
return;
429429
}
430430
int last = hi - 1;
431-
int parent = ((last - 1) >> 1);
431+
int parent = ((last - 1) >>> 1);
432432

433433
while(parent >= lo) {
434434
__heapify(a, parent, last);
@@ -547,7 +547,7 @@ private static void __heapSort(long[] a, int lo, int hi) {
547547
return;
548548
}
549549
int last = hi - 1;
550-
int parent = ((last - 1) >> 1);
550+
int parent = ((last - 1) >>> 1);
551551

552552
while(parent >= lo) {
553553
__heapify(a, parent, last);
@@ -665,7 +665,7 @@ private static void __heapSort(float[] a, int lo, int hi) {
665665
return;
666666
}
667667
int last = hi - 1;
668-
int parent = ((last - 1) >> 1);
668+
int parent = ((last - 1) >>> 1);
669669

670670
while(parent >= lo) {
671671
__heapify(a, parent, last);
@@ -783,7 +783,7 @@ private static void __heapSort(double[] a, int lo, int hi) {
783783
return;
784784
}
785785
int last = hi - 1;
786-
int parent = ((last - 1) >> 1);
786+
int parent = ((last - 1) >>> 1);
787787

788788
while(parent >= lo) {
789789
__heapify(a, parent, last);
@@ -904,7 +904,7 @@ private static void __heapSort(Object[] a, int lo, int hi) {
904904
return;
905905
}
906906
int last = hi - 1;
907-
int parent = ((last - 1) >> 1);
907+
int parent = ((last - 1) >>> 1);
908908

909909
while(parent >= lo) {
910910
__heapify(a, parent, last);
@@ -1031,7 +1031,7 @@ private static <T> void __heapSort(T[] a, int lo, int hi, Comparator<? super T>
10311031
return;
10321032
}
10331033
int last = hi - 1;
1034-
int parent = ((last - 1) >> 1);
1034+
int parent = ((last - 1) >>> 1);
10351035

10361036
while(parent >= lo) {
10371037
__heapify(a, parent, last, c);

0 commit comments

Comments
 (0)