Java - Array methods assignment - Revision history

Admin: /* Testing ArrayMethods */

2015-10-21T14:31:27Z

‎Testing ArrayMethods

Admin: /* Testing ArrayMethods */

2015-10-21T14:31:16Z

‎Testing ArrayMethods

Admin: /* Testing ArrayMethods */

2015-10-21T14:30:46Z

‎Testing ArrayMethods

Admin at 14:29, 21 October 2015

2015-10-21T14:29:27Z

Admin at 12:42, 21 October 2015

2015-10-21T12:42:37Z

Admin at 12:18, 21 October 2015

2015-10-21T12:18:28Z

Admin: Created page with "=== Objective(s) === * You will be able to create a class comprised of static methods * You will be able to define static methods * You will be able to use/call static methods * ..."

2015-10-21T12:12:29Z

Created page with "=== Objective(s) === * You will be able to create a class comprised of static methods * You will be able to define static methods * You will be able to use/call static methods * ..."

New page

=== Objective(s) ===
* You will be able to create a class comprised of static methods
* You will be able to define static methods
* You will be able to use/call static methods
* You will be able to implement various array algorithms
** printing an array
** generating a random array
** sum all the elements
** finding the minimum
** finding the maximum
** finding any element

=== Directions ===
# Open NetBeans and create a new project named ArrayMethodsProject
# Create a new class file named ArrayMethods.java (it should not contain a main() method)
# Define the following methods:
#* void print(int[] intArray)
#** Traverse the array and print out each element on one long line
#* int[] generateRandom(int size, int lower, int upper)
#** Within this method, you will create a new array of '''size''' length. You will populate it with random integers that range from '''lower''' to '''upper'''. Return the array
#* int sum(int[] intArray)
#** Traverse the array and sum all the elements. Return the sum.
#* int min(int[] intArray)
#** Traverse the array and find the smallest element. Return the minimum
#** Hint: We did this in eIMACS in the Arrays chapter
#* int max(int[] intArray)
#** Traverse the array and find the largest element. Return the maximum
#** Hint: We did this in eIMACS in the Arrays chapter
#* int indexOf(int key)
#** Traverse the array and check if any elements in the array match '''key'''. If so, return the index of the match, otherwise, return -1 if there is no match.

=== Testing ArrayMethods ===
# Create a new Java class with a main() method
# Within the main() method, use the ArrayMethods to create an array and test out each of your methods

@@ Line 37: / Line 37: @@
 //Example:
-int[] randomNums = ArrayMethods.generateRandom(10, 0, 10);
+int[] randomNums = ArrayMethods.generateRandom(10, 0, 100);
 ArrayMethods.print(randomNums);
 </syntaxhighlight>

@@ Line 33: / Line 33: @@
 # Create a new Java class with a main() method
 # Within the main() method, use the ArrayMethods to create an array and test out each of your methods
 <syntaxhighlight lang="Java">
 int[] randomNums = ArrayMethods.generateRandom(10, 0, 10);
 ArrayMethods.print(randomNums);
 </syntaxhighlight>

@@ Line 30: / Line 30: @@
 #** Traverse the intArray and check if any elements in the array match '''key'''.  If so, return the index of the match, otherwise, return -1 if there is no match.
-=== Testing ArrayMethods ===
+== Testing ArrayMethods ==
 # Create a new Java class with a main() method
 # Within the main() method, use the ArrayMethods to create an array and test out each of your methods

@@ Line 1: / Line 1: @@
-=== Objective(s) ===
+== Objective(s) ==
 * You will be able to create a class comprised of static methods
 * You will be able to define static methods
@@ Line 11: / Line 11: @@
 ** finding any element
-=== Directions ===
+== Directions ==
 # Open NetBeans and create a new project named ArrayMethodsProject
 # Create a new class file named ArrayMethods.java (it should not contain a main() method)

@@ Line 27: / Line 27: @@
 #** Traverse the array and find the largest element. Return the maximum
 #** Hint: This algorithm is almost identical to finding the minimum
-#* int indexOf(int key)
+#* int indexOf(int[] intArray, int key)
-#** Traverse the array and check if any elements in the array match '''key'''.  If so, return the index of the match, otherwise, return -1 if there is no match.
+#** Traverse the intArray and check if any elements in the array match '''key'''.  If so, return the index of the match, otherwise, return -1 if there is no match.
 === Testing ArrayMethods ===
 # Create a new Java class with a main() method
 # Within the main() method, use the ArrayMethods to create an array and test out each of your methods

@@ Line 23: / Line 23: @@
 #* int min(int[] intArray)
 #** Traverse the array and find the smallest element. Return the minimum
-#** Hint: We did this in eIMACS in the Arrays chapter
+#** Hint: Create a variable to "remember" the minimum as you traverse the array.  If the current element is smaller than your minimum, then update the minimum to the new element
 #* int max(int[] intArray)
 #** Traverse the array and find the largest element. Return the maximum
-#** Hint: We did this in eIMACS in the Arrays chapter
+#** Hint: This algorithm is almost identical to finding the minimum
 #* int indexOf(int key)
 #** Traverse the array and check if any elements in the array match '''key'''.  If so, return the index of the match, otherwise, return -1 if there is no match.