$5\mathrm{.}28$ LAB: Sort an array

Define a method named sortArray that takes an array of integers and the number of elements in the array as parameters. Method sortArray$()$ modifies the array parameter by sorting the elements in descending order $($highest to lowest$).$ Then write a main program that reads a list of integers from input, stores the integers $($starting from the second integer$)$ in an array, calls sortArray$(),$ and outputs the sorted array. The first input integer indicates how many numbers are in the list. Assume that the list will always contain less than $20$ integers.

Ex: If the input is:

$5,10,4,39,12,2$

the output is:

$39,12,10,4,2,$

For coding simplicity, follow every output value by a comma, including the last one.

Your program must define and call the following method: public static void sortArray$($int$[]$ myArr, int arrSize$)$

Hint: Sorting an array can be done in many ways. You are welcome to look up and use any existing algorithm. Some believe the simplest to code is bubble sort: Bubble sort Wikipedia article. But you are welcome to try others: Sorting algorithm Wikipedia article.

$535396\mathrm{.}2979738$ ax $3z$ qy $7$

LAB

ACTIVITY

$5\mathrm{.}28\mathrm{.}1$: LAB: Sort an array

$\frac{0}{10}$

LabProgram.java

import java.util.Scanner;

import java.util.Random;

public class LabProgram $\{$

public static String coinFlip$($Random rand$)\{$

int flip $=$ rand. nextInt $(2)$;

if $($ flip $==1)\{$

return "Heads";

$\}$ else $\{$

return "Tails";

$\}$

$\}$

public static void main$($String$[]$ args$)\{$

Scanner scnr $=$ new Scanner$($

System.in$)$;

Random rand $=$ new Random$(2)$; $//$ Unique seed