forked from JCarlosR/Sorting-Algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathBubbleSort.java
More file actions
39 lines (34 loc) · 1.07 KB
/
BubbleSort.java
File metadata and controls
39 lines (34 loc) · 1.07 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
import java.util.Scanner;
public class BubbleSort {
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
System.out.print("Enter the number of elements : ");
int n = sc.nextInt();
int arr[] = new int[n];
System.out.println("Enter " + n + " elements :");
for (int i = 0; i < n; i++)
arr[i] = sc.nextInt();
bubbleSort(arr);
System.out.println("\nThe sorted array : ;");
for (int i = 0; i < n; i++)
System.out.print(arr[i] + " ");
System.out.println();
}
static void bubbleSort(int arr[]) {
int len = arr.length, tmp;
boolean flag;
for (int i = 0; i < len; i++) {
flag = false;
for (int j = 0; j < len - i - 1; j++) {
if (arr[j] > arr[j + 1]) {
tmp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = tmp;
flag = true;
}
}
if (!flag)
break;
}
}
}