-
Notifications
You must be signed in to change notification settings - Fork 0
/
BubbleSort.java
96 lines (91 loc) · 2.61 KB
/
BubbleSort.java
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
package bubble;
import sort.AbstractBase;
/**
* Class BubbleSort.
*
* @author Sanju Sci<sanju.sci9@gmail.com>
*
* <p>Complexity in worst case is <b>O(n^2)</b>.</p>
*/
public class BubbleSort extends AbstractBase {
/**
* Function basicBubbleSort
* This function is used to sort array using bubble sort.
*
* @param array An array that contains integer input array list.
* @return Return sorted array list.
* <p>
* array[] = {5, 7, 1, 4, 2, 9, 3}
* 1 4 2 5 3 7 9
* 1 2 4 3 5 7 9
* 1 2 3 4 5 7 9
* 1 2 3 4 5 7 9
* 1 2 3 4 5 7 9
* 1 2 3 4 5 7 9
*/
public Integer[] basicBubbleSort(Integer array[]) {
int n = array.length;
int temp;
for (int i = 0; i < n; i++) {
for (int j = 0; j < (n - i - 1); j++) {
if (array[j] > array[j + 1]) {
temp = array[j];
array[j] = array[j + 1];
array[j + 1] = temp;
}
}
//this.printArray(array);
}
return array;
}
/**
* Function basicBubbleSort
* This function is used to sort array using bubble sort.
*
* @param array An array that contains integer input array list.
* @return Return sorted array list.
* <p>
* array[] = {5, 7, 1, 4, 2, 9, 3}
* 5 1 4 2 7 3 9
* 1 4 2 5 3 7 9
* 1 2 4 3 5 7 9
* 1 2 3 4 5 7 9
*/
public Integer[] optimizedBubbleSort(Integer array[]) {
int n = array.length;
int temp;
boolean sorted; // This flag will stop/break the loop once elements are sorted.
for (int i = 0; i < n; i++) {
sorted = true;
for (int j = 0; j < (n - i - 1); j++) {
if (array[j] > array[j + 1]) {
temp = array[j];
array[j] = array[j + 1];
array[j + 1] = temp;
sorted = false;
}
}
if (sorted) break;
}
return array;
}
@Override
public <E extends Comparable<E>> E[] genericSort(E[] array) {
int n = array.length;
E temp;
boolean sorted;
for (int i = 0; i < n; i++) {
sorted = true;
for (int j = 0; j < (n - i - 1); j++) {
if (array[j].compareTo(array[j + 1]) > 0) {
temp = array[j];
array[j] = array[j + 1];
array[j + 1] = temp;
sorted = false;
}
}
if (sorted) break;
}
return array;
}
}