-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathFindingMEdian.java
39 lines (29 loc) · 985 Bytes
/
FindingMEdian.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
package finding.median;
import java.util.Scanner;
public class FindingMEdian {
public static void main(String[] args) {
// TODO code application logic here
Scanner scan=new Scanner(System.in);
System.out.print("Enter array size:");
int size=scan.nextInt();
int[] array=new int[size];
System.out.println("Array elements :");
for(int i=0;i<size;i++){
array[i]=scan.nextInt();
}
System.out.println("Array elements after sorting:"+sort(array));
}
public static int[] sort(int[] array){
int temp=0;
for(int i=0;i<array.length;i++){
for(int j=0;j<(array.length-i-1);j++){
if(array[j]>array[j+1]){
temp=array[j];
array[j]=array[j+1];
array[j+1]=temp;
}
}
}
return array;
}
}