-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathLE_13_1_23.java
35 lines (28 loc) · 1.01 KB
/
LE_13_1_23.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
package Assignments;
import java.util.Scanner;
public class LE_13_1_23 {
public static void main(String ... a){
Scanner in = new Scanner(System.in);
int n;
System.out.print("Enter no.of elements:");
n = in.nextInt();
System.out.println("Enter the elements:");
int[] arr = new int[n];
for(int i=0; i<n; i++)
{
arr[i]=in.nextInt();
}
int numSwaps = 0;
for(int i=0; i < n; i++){
for(int j=1; j < (n-i); j++){
if(arr[j-1] > arr[j]){
numSwaps+=1;
arr[j -1] = (arr[j-1] + arr[j]) - (arr[j] = arr[j-1]);
}
}
}
System.out.println("Array is sorted in " + numSwaps + " swaps");
System.out.println("First Element: " + arr[0]);
System.out.println("Last Element: "+ arr[n-1]);
}
}