You need to be able to code these algorithms quickly. Links have some solutions.
1) Read from a text file (CSV) into a one dimensional array – text file only has one value per line.
2) Read from a text file (CSV) into an array of objects – text file is more like a simple database.
3) Create an array with random values.
4) Print the array values one per line.
5) Find the maximum (or minimum) value in an array.
6) Compute the average (or sum) of the array values.
7) Reverse the values within an array (by using a second array)
8) Copy the sequence of values to another array.
9) Search an array for a specific String value. Once found, the algorithm breaks out of the loop so you don’t continue to search for something you have already found. Uses the Java reserved word “break” to do this.
10) Sort an array into alphabetical order.
11) Search and find duplicates within an array.
Whether these are part of a tiny one class literal program or part of a bigger, multi-variable, multi-class program is not important.