-
Notifications
You must be signed in to change notification settings - Fork 22
Expand file tree
/
Copy pathBubbleSortV2.java
More file actions
45 lines (41 loc) · 1.02 KB
/
BubbleSortV2.java
File metadata and controls
45 lines (41 loc) · 1.02 KB
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
package com.examplehub.sorts;
import com.examplehub.utils.SortUtils;
public class BubbleSortV2 implements Sort {
/**
* BubbleSort algorithm implements.
*
* @param numbers the numbers to be sorted.
*/
public void sort(int[] numbers) {
int n = numbers.length - 1;
while (n != 0) {
int lastSwapIdx = 0;
for (int i = 0; i < n; ++i) {
if (numbers[i] > numbers[i + 1]) {
SortUtils.swap(numbers, i, i + 1);
lastSwapIdx = i;
}
}
n = lastSwapIdx;
}
}
/**
* Generic BubbleSort algorithm implements.
*
* @param array the array to be sorted.
* @param <T> the class of the objects in the array.
*/
public <T extends Comparable<T>> void sort(T[] array) {
int n = array.length - 1;
while (n != 0) {
int lastSwapIdx = 0;
for (int i = 0; i < n; ++i) {
if (array[i].compareTo(array[i + 1]) > 0) {
SortUtils.swap(array, i, i + 1);
lastSwapIdx = i;
}
}
n = lastSwapIdx;
}
}
}