Question

I need it in JAVA

Write a program that randomly populates an array of size 100, sorts it, and then finds the median. The random numbers must be from 0-99 and all integer values. Also since there is an even set of numbers the median is found by taking the mean of the two middle numbers (In other words the 50^th and 51^st).

You have to code your own sorting method. You may not use a built in java sorter.

Keep in mind the 50^th and 51^st correspond to the number of items not necessarily the index of the array.

Comment your code

Example Dialog:

Random array

13

80

93

90

46

56

97

88

81

14

23

99

91

8

95

80

86

53

73

38

93

9

95

8

35

49

74

70

8

50

48

2

72

96

17

75

10

10

55

33

39

37

92

12

68

99

98

94

41

43

5

61

71

95

81

89

8

92

8

68

60

14

36

99

36

44

90

45

99

28

22

80

68

37

51

63

63

81

79

24

33

62

8

2

88

61

79

59

48

7

37

57

7

7

36

39

23

48

32

39

Sorted array

2

2

5

7

7

7

8

8

8

8

8

8

9

10

10

12

13

14

14

17

22

23

23

24

28

32

33

33

35

36

36

36

37

37

37

38

39

39

39

41

43

44

45

46

48

48

48

49

50

51

53

55

56

57

59

60

61

61

62

63

63

68

68

68

70

71

72

73

74

75

79

79

80

80

80

81

81

81

86

88

88

89

90

90

91

92

92

93

93

94

95

95

95

96

97

98

99

99

99

99

Median is 52

Answer 1

MedianTest.java

import java.util.Random;

public class MedianTest {

public static void main(String[] args) {

int a[] = new int[100];

Random r = new Random();

for(int i=0;i<a.length;i++) {

a[i]=r.nextInt(100);

}

System.out.println("Random array: ");

for(int i=0;i<a.length;i++) {

System.out.print(a[i]+" ");

}

System.out.println();

buubleSort(a);

System.out.println("Sorted array: ");

for(int i=0;i<a.length;i++) {

System.out.print(a[i]+" ");

}

System.out.println();

double median = (a[49] + a[50])/2.0;

System.out.println("Median: "+median);

}

public static void buubleSort(int[] a) {

int n = a.length;

int temp = 0;

for(int i=0; i < n; i++){

for(int j=1; j < (n-i); j++){

if(a[j-1] > a[j]){

//swap the elements!

temp = a[j-1];

a[j-1] = a[j];

a[j] = temp;

}

}

}

}

}

Output:

Random array:
90 41 76 56 75 84 94 37 53 11 39 89 3 45 90 2 80 18 18 19 9 92 3 76 24 15 15 29 42 49 84 25 42 18 3 25 35 58 4 55 68 31 23 19 48 7 50 29 57 19 13 65 30 55 26 7 64 31 35 22 1 98 15 68 64 45 20 72 66 78 50 77 10 56 60 51 93 3 49 9 49 54 40 66 47 65 13 64 40 68 23 47 29 95 82 66 19 39 34 76
Sorted array:
1 2 3 3 3 3 4 7 7 9 9 10 11 13 13 15 15 15 18 18 18 19 19 19 19 20 22 23 23 24 25 25 26 29 29 29 30 31 31 34 35 35 37 39 39 40 40 41 42 42 45 45 47 47 48 49 49 49 50 50 51 53 54 55 55 56 56 57 58 60 64 64 64 65 65 66 66 66 68 68 68 72 75 76 76 76 77 78 80 82 84 84 89 90 90 92 93 94 95 98
Median: 43.5