-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathbubbleSort.java
51 lines (45 loc) · 956 Bytes
/
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
package Sorting;
import java.util.Scanner;
public class bubbleSort
{
public static void sort(int []arr)
{
for(int i = 0;i<arr.length-1;i++)
{
for(int j=0;j<arr.length-i-1;j++)
{
if(arr[j]>arr[j+1])
{
int temp = arr[j];
arr[j] = arr[j+1];
arr[j+1] = temp;
}
}
}
System.out.print("sorted array by Bubble Sort ");
printArray(arr);
}
public static 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)
{
Scanner sc = new Scanner(System.in);
System.out.print("Enter the size of array : ");
int size = sc.nextInt();
int[] input_arr = new int[size];
for(int i=0; i<size; i++)
{
System.out.print("Enter the element at "+ i + "th term : ");
input_arr[i] = sc.nextInt();
}
System.out.print("Original array ");
printArray(input_arr);
sort(input_arr);
}
}