-
Notifications
You must be signed in to change notification settings - Fork 0
/
SortArray.java
41 lines (31 loc) · 828 Bytes
/
SortArray.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
/*Write a program to sort an array of numbers using any sorting
technique */
import java.util.Scanner;
class SortArray{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.print("Enter max value for array : ");
int max = sc.nextInt();
int arr[] = new int[max];
System.out.println("Enter elements one by one : ");
for(int i =0;i<arr.length;i++)
arr[i] = sc.nextInt();
//sorting -> Bubble Sort
int temp =0;
for(int i=0;i<arr.length;i++)
{
for(int j =0;j<arr.length-1-i;j++)
{
if(arr[j] > arr[j+1])
{
temp = arr[j];
arr[j] = arr[j+1];
arr[j+1] = temp;
}
}
}
System.out.println("Array after sorting : ");
for(int i= 0;i<arr.length;i++)
System.out.print(arr[i]+" ");
}
}