-
Notifications
You must be signed in to change notification settings - Fork 0
/
bsort.java
44 lines (41 loc) · 1.27 KB
/
bsort.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
import java.util.Scanner;
public class bsort {
public static void bubbleSort(int[] a,int n){
int temp=0;
int isSorted=0;
for(int i=0;i<n-1;i++)
{
isSorted=1;
System.out.println("\nAfter pass: "+(i+1)+"\n");
for(int j=0;j<n-i-1;j++)
{
if(a[j]>a[j+1]){
temp=a[j];
a[j]=a[j+1];
a[j+1]=temp;
isSorted=0;
}
}
if(isSorted==1)
return;
}
}
public static void display(int[] a,int n){
for(int i=0;i<n;i++)
System.out.print(a[i]+" ");
}
public static void main(String[] args){
Scanner sc=new Scanner(System.in);
System.out.println("Enter the size of the array: ");
int n=sc.nextInt();
int[]a =new int[n];
System.out.println("Enter the elements: ");
for(int i=0;i<n;i++)
a[i]=sc.nextInt();
System.out.println("Array before sorting: ");
display(a,n);
bubbleSort(a,n);
System.out.println("\nArray after sorting: ");
display(a,n);
}
}