CSC 320 Midterm: CSC 320 UVic Midterm02Midterm 2

24. Consider the Insertion Sort (code 3) algorithm described in the appendix. How can we change this code to have the algorithm sort from largest to smallest instead? (A) Change line 9 to: a[j-1] = a[j]; (B) Change line 7 to: while(j >0 && a[j - 1] 0; i--) (E) Change line 12 to: a[i] = x;

Write a program called Lab 5 that has 3 methods and a main method:
1) Method isUserNameValid has 1 parameter of type string and the method returns a value of type
boolean. If the parameter has less than 8 characters then the method returns false, otherwise it
returns true.
2) Method compare has 3 parameters all of type int and has a String return type. This method will
return
a. “All Same” if all 3 parameters are equal,
b. “All Different” if all 3 parameters are different.
c. “Mix number(s)” two of the numbers are the same and the 3rd is different.
3) Method isValid has 1 parameter of type int and returns a boolean value; the method returns true if
the parameter is in the range 0,…,100 inclusive, otherwise the method returns false.
4) Main method. I want you to test methods isValid & isUsernameValid one time with a valid data
and another time with an invalid data. As for method compare test it 3 times so you can get the 3
different possible outcomes.
Example to test the isUserNameValid method

(0) public class ReferenceTest 6 public static void methodSix (int) 1 x){ x[0] = new int [2]; x[0][0] = 0; x(01 (1) = 1; x = new int [10] [5); x[0] (3) = 3; public static void main(String[] args) { int[] O Y = [ {1,2,3}, {2,4}}; methodSix (y); //WHAT ARE THE VALUES IN THE ARRAY OF ARRAYS //REFERRED TO BY Y AT THIS POINT? (ANSWER IN CHART)