-
Notifications
You must be signed in to change notification settings - Fork 875
Expand file tree
/
Copy pathBubbleSort.java
More file actions
44 lines (40 loc) · 865 Bytes
/
Copy pathBubbleSort.java
File metadata and controls
44 lines (40 loc) · 865 Bytes
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
package misc;
/**
* Steps:-
* Bubble Sort algorithm that works by repeatedly swapping the adjacent elements if they are in wrong order.
*
*/
public class BubbleSort {
public void bubbleSort(int[] arr) {
boolean swap;
int n = arr.length;
int tmp = 0;
for (int i = 0; i < n ; i++) {
swap = false;
for (int j = 1; j < n-i; j++) {
if (arr[j-1] > arr[j]) {
tmp = arr[j];
arr[j] = arr[j-1];
arr[j-1] = tmp;
swap = true;
}
}
if (!swap){
break;
}
}
}
void printArray(int arr[]) {
for (int i = 0; i < arr.length; i++) {
System.out.print(arr[i] + " ");
}
System.out.println("");
}
public static void main(String[] args) {
BubbleSort obj = new BubbleSort();
int arr[] = { 64, 34, 25, 12, 22, 11, 90 };
obj.bubbleSort(arr);
System.out.println("Sorted Array");
obj.printArray(arr);
}
}