-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathBubble_Sort.java
More file actions
84 lines (72 loc) · 2.06 KB
/
Bubble_Sort.java
File metadata and controls
84 lines (72 loc) · 2.06 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
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
import java.util.Scanner;
public class Main {
public static void bubble(int[] arr, int len) {
for (int j = 0; j < len - 1; j++) {
for (int i = 0; i < len - 1 - j; i++) {
if (arr[i] > arr[i + 1]) {
int swap = arr[i];
arr[i] = arr[i + 1];
arr[i + 1] = swap;
}
}
}
}
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
int len = input.nextInt();
int[] arr = new int[len];
for (int i = 0; i < len; i++) {
arr[i] = input.nextInt();
}
bubble(arr, len);
for (int i = 0; i < arr.length; i++) {
System.out.print(arr[i] + " ");
}
}
}
// modified bubble sort with less time complexity
import java.util.Scanner;
public class Main {
public static void bubble(int[] arr, int len) {
if (check(arr)==0){
return;
}
else{
for (int j = 0; j < len - 1; j++) {
for (int i = 0; i < len - 1 - j; i++) {
if (arr[i] > arr[i + 1]) {
int swap = arr[i];
arr[i] = arr[i + 1];
arr[i + 1] = swap;
}
}
}
}
}
public static int check(int arr[]){
int index=0;
for(int i=0;i<arr.length;i++){
if(arr[i]<arr[i+1]){
index=0;
continue;
}
else{
index=1;
break;
}
}
return index;
}
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
int len = input.nextInt();
int[] arr = new int[len];
for (int i = 0; i < len; i++) {
arr[i] = input.nextInt();
}
bubble(arr, len);
for (int i = 0; i < arr.length; i++) {
System.out.print(arr[i] + " ");
}
}
}