Unit 3-1 HW

1. public static String decimalToHex(int decimal) {
String hex = “ “; while (decimal != 0) { int hexValue = decimal % 16; hex = toHexChar(hexValue) + hex; decimal = decimal / 16;
}
return hex;
}
2. The Math.random creates a random number with the double data type. 3. public static void main(String[] args) {
System.out.println(max(1,2));
} public static double max(int num1, double num2) { if (num1 > num2) return num1; else return num2; } public static double max(double num1, int num2) { if (num1 > num2) return num1; else return num2; } 4. It is a way of writing code; you either start at the top and work your way down or begin at the outcome and work in reverse. 5. Simpler program, reusing methods, better facilitating teamwork, easier developing, debugging, and testing. 6. Method Variable 7. for (int i = 0; i >= 0; i--) {
JOptionPane.showMessageDialog(null, i); } 8. Array is fixed while ArrayList can change its size to what is needed. 9. package com.java2novice.algos; public class MyInsertionSort { public static void main(String[] args) { int[] input = { 4, 2, 9, 6, 23, 12, 34, 0, 1 }; insertionSort(input); } private static void printNumbers(int[] input) { for (int i = 0; i < input.length; i++) {
System.out.print(input[i] + ", ");
}
System.out.println("\n");
}
public static void insertionSort(int array[]) { int n = array.length; for (int j = 1; j < n; j++) { int key = array[j]; int i = j-1; while ( (i > -1) && ( array [i] > key ) ) { array [i+1] = array [i]; i--; } array[i+1] = key; printNumbers(array); }
}
} 10. A linear search just looks down the list and for a short list I would suggest this, but for a large list and multi-dimensional lists I suggest a binary search since it starts from the middle and spreads out.