Core Java(TM) 2, Volume I--Fundamentals (7th Edition) (Core Series) (Core Series)

An array is a data structure that stores a collection of values of the same type. You access each individual value through an integer index. For example, if a is an array of integers, then a[i] is the ith integer in the array.

You declare an array variable by specifying the array type which is the element type followed by [] and the array variable name. For example, here is the declaration of an array a of integers:

int[] a;

However, this statement only declares the variable a. It does not yet initialize a with an actual array. You use the new operator to create the array.

int[] a = new int[100];

This statement sets up an array that can hold 100 integers.

NOTE

The array entries are numbered from 0 to 99 (and not 1 to 100). Once the array is created, you can fill the entries in an array, for example, by using a loop:

int[] a = new int[100]; for (int i = 0; i < 100; i++) a[i] = i; // fills the array with 0 to 99

CAUTION

To find the number of elements of an array, use array.length. For example,

for (int i = 0; i < a.length; i++) System.out.println(a[i]);

Once you create an array, you cannot change its size (although you can, of course, change an individual array element). If you frequently need to expand the size of an array while a program is running, you should use a different data structure called an array list. (See Chapter 5 for more on array lists.)

The "for each" Loop

JDK 5.0 introduces a powerful looping construct that allows you to loop through each element in an array (as well as other collections of elements) without having to fuss with index values.

The enhanced for loop

for (variable : collection) statement

sets the given variable to each element of the collection and then executes the statement (which, of course, may be a block). The collection expression must be an array or an object of a class that implements the Iterable interface, such as ArrayList. We discuss array lists in Chapter 5 and the Iterable interface in Chapter 2 of Volume 2.

For example,

for (int element : a) System.out.println(element);

prints each element of the array a on a separate line.

You should read this loop as "for each element in a". The designers of the Java language considered using keywords such as foreach and in. But this loop was a late addition to the Java language, and in the end nobody wanted to break old code that already contains methods or variables with the same names (such as System.in).

Of course, you could achieve the same effect with a traditional for loop:

for (int i = 0; i < a.length; i++) System.out.println(a[i]);

However, the "for each" loop is more concise and less error prone. (You don't have to worry about those pesky start and end index values.)

NOTE

The "for each" loop is a pleasant improvement over the traditional loop if you need to process all elements in a collection. However, there are still plenty of opportunities to use the traditional for loop. For example, you may not want to traverse the entire collection, or you may need the index value inside the loop.

Array Initializers and Anonymous Arrays

Java has a shorthand to create an array object and supply initial values at the same time. Here's an example of the syntax at work:

int[] smallPrimes = { 2, 3, 5, 7, 11, 13 };

Notice that you do not call new when you use this syntax.

You can even initialize an anonymous array:

new int[] { 17, 19, 23, 29, 31, 37 }

This expression allocates a new array and fills it with the values inside the braces. It counts the number of initial values and sets the array size accordingly. You can use this syntax to reinitialize an array without creating a new variable. For example,

smallPrimes = new int[] { 17, 19, 23, 29, 31, 37 };

is shorthand for

int[] anonymous = { 17, 19, 23, 29, 31, 37 }; smallPrimes = anonymous;

NOTE

Array Copying

You can copy one array variable into another, but then both variables refer to the same array:

int[] luckyNumbers = smallPrimes; luckyNumbers[5] = 12; // now smallPrimes[5] is also 12

Figure 3-15 shows the result. If you actually want to copy all values of one array into another, you use the arraycopy method in the System class. The syntax for this call is

System.arraycopy(from, fromIndex, to, toIndex, count);

The to array must have sufficient space to hold the copied elements.

For example, the following statements, whose result is illustrated in Figure 3-16, set up two arrays and then copy the last four entries of the first array to the second array. The copy starts at position 2 in the source array and copies four entries, starting at position 3 of the target.

int[] smallPrimes = {2, 3, 5, 7, 11, 13}; int[] luckyNumbers = {1001, 1002, 1003, 1004, 1005, 1006, 1007}; System.arraycopy(smallPrimes, 2, luckyNumbers, 3, 4); for (int i = 0; i < luckyNumbers.length; i++) System.out.println(i + ": " + luckyNumbers[i]);

The output is

0: 1001 1: 1002 2: 1003 3: 5 4: 7 5: 11 6: 13

C++ NOTE

Command-Line Parameters

You have already seen one example of Java arrays repeated quite a few times. Every Java program has a main method with a String[] args parameter. This parameter indicates that the main method receives an array of strings, namely, the arguments specified on the command line.

For example, consider this program:

public class Message { public static void main(String[] args) { if (args[0].equals("-h")) System.out.print("Hello,"); else if (args[0].equals("-g")) System.out.print("Goodbye,"); // print the other command-line arguments for (int i = 1; i < args.length; i++) System.out.print(" " + a[i]); System.out.println("!"); } }

If the program is called as

java Message -g cruel world

then the args array has the following contents:

args[0]: "-g" args[1]: "cruel" args[2]: "world"

The program prints the message

Goodbye, cruel world!

C++ NOTE

Array Sorting

To sort an array of numbers, you can use one of the sort methods in the Arrays class:

int[] a = new int[10000]; . . . Arrays.sort(a)

This method uses a tuned version of the QuickSort algorithm that is claimed to be very efficient on most data sets. The Arrays class provides several other convenience methods for arrays that are included in the API notes at the end of this section.

The program in Example 3-7 puts arrays to work. This program draws a random combination of numbers for a lottery game. For example, if you play a "choose 6 numbers from 49" lottery, then the program might print:

Bet the following combination. It'll make you rich! 4 7 8 19 30 44

To select such a random set of numbers, we first fill an array numbers with the values 1, 2, . . ., n:

int[] numbers = new int[n]; for (int i = 0; i < numbers.length; i++) numbers[i] = i + 1;

A second array holds the numbers to be drawn:

int[] result = new int[k];

Now we draw k numbers. The Math.random method returns a random floating-point number that is between 0 (inclusive) and 1 (exclusive). By multiplying the result with n, we obtain a random number between 0 and n 1.

int r = (int) (Math.random() * n);

We set the ith result to be the number at that index. Initially, that is just r itself, but as you'll see presently, the contents of the numbers array are changed after each draw.

result[i] = numbers[r];

Now we must be sure never to draw that number again all lottery numbers must be distinct. Therefore, we overwrite numbers[r] with the last number in the array and reduce n by 1.

numbers[r] = numbers[n - 1]; n--;

The point is that in each draw we pick an index, not the actual value. The index points into an array that contains the values that have not yet been drawn.

After drawing k lottery numbers, we sort the result array for a more pleasing output:

Arrays.sort(result); for (int r : result) System.out.println(r);

Example 3-7. LotteryDrawing.java

1. import java.util.*; 2. 3. public class LotteryDrawing 4. { 5. public static void main(String[] args) 6. { 7. Scanner in = new Scanner(System.in); 8. 9. System.out.print("How many numbers do you need to draw? "); 10. int k = in.nextInt(); 11. 12. System.out.print("What is the highest number you can draw? "); 13. int n = in.nextInt(); 14. 15. // fill an array with numbers 1 2 3 . . . n 16. int[] numbers = new int[n]; 17. for (int i = 0; i < numbers.length; i++) 18. numbers[i] = i + 1; 19. 20. // draw k numbers and put them into a second array 21. int[] result = new int[k]; 22. for (int i = 0; i < result.length; i++) 23. { 24. // make a random index between 0 and n - 1 25. int r = (int) (Math.random() * n); 26. 27. // pick the element at the random location 28. result[i] = numbers[r]; 29. 30. // move the last element into the random location 31. numbers[r] = numbers[n - 1]; 32. n--; 33. } 34. 35. // print the sorted array 36. Arrays.sort(result); 37. System.out.println("Bet the following combination. It'll make you rich!"); 38. for (int r : result) 39. System.out.println(r); 40. } 41. }

java.lang.System 1.1

• static void arraycopy(Object from, int fromIndex, Object to, int toIndex, int count)

  copies elements from the first array to the second array.

  Parameters:	from	an array of any type (Chapter 5 explains why this is a parameter of type Object)
  	fromIndex	the starting index from which to copy elements
  	to	an array of the same type as from
  	toIndex	the starting index to which to copy elements
  	count	the number of elements to copy

java.util.Arrays 1.2

• static void sort(type[] a)

  sorts the array, using a tuned QuickSort algorithm.

  Parameters:	a	an array of type int, long, short, char, byte, float or double

• static int binarySearch(type[] a, type v)

  uses the BinarySearch algorithm to search for the value v. If it is found, its index is returned. Otherwise, a negative value r is returned; -r - 1 is the spot at which v should be inserted to keep a sorted.

  Parameters:	a	a sorted array of type int, long, short, char, byte, float or double
  	v	a value of the same type as the elements of a

• static void fill(type[] a, type v)

  sets all elements of the array to v.

  Parameters:	a	an array of type int, long, short, char, byte, boolean, float or double
  	v	A value of the same type as the elements of a

• static boolean equals(type[] a, type[] b)

  returns TRue if the arrays have the same length, and if the elements in corresponding indexes match.

  Parameters:	a, b	arrays of type int, long, short, char, byte, boolean, float or double

Multidimensional Arrays

Multidimensional arrays use more than one index to access array elements. They are used for tables and other more complex arrangements. You can safely skip this section until you have a need for this storage mechanism.

Suppose you want to make a table of numbers that shows how much an investment of $10,000 will grow under different interest rate scenarios in which interest is paid annually and reinvested. Table 3-8 illustrates this scenario.

You can store this information in a two-dimensional array (or matrix), which we call balances.

Declaring a two-dimensional array in Java is simple enough. For example:

double[][] balances;

As always, you cannot use the array until you initialize it with a call to new. In this case, you can do the initialization as follows:

balances = new double[NYEARS][NRATES];

In other cases, if you know the array elements, you can use a shorthand notion for initializing multidimensional arrays without needing a call to new. For example:

int[][] magicSquare = { {16, 3, 2, 13}, {5, 10, 11, 8}, {9, 6, 7, 12}, {4, 15, 14, 1} };

Once the array is initialized, you can access individual elements by supplying two brackets, for example, balances[i][j].

The example program stores a one-dimensional array interest of interest rates and a two-dimensional array balance of account balances, one for each year and interest rate. We initialize the first row of the array with the initial balance:

for (int j = 0; j < balance[0].length; j++) balances[0][j] = 10000;

Then we compute the other rows, as follows:

for (int i = 1; i < balances.length; i++) { for (int j = 0; j < balances[i].length; j++) { double oldBalance = balances[i - 1][j]; double interest = . . .; balances[i][j] = oldBalance + interest; } }

Example 3-8 shows the full program.

NOTE

Example 3-8. CompoundInterest.java

1. public class CompoundInterest 2. { 3. public static void main(String[] args) 4. { 5. final int STARTRATE = 10; 6. final int NRATES = 6; 7. final int NYEARS = 10; 8. 9. // set interest rates to 10 . . . 15% 10. double[] interestRate = new double[NRATES]; 11. for (int j = 0; j < interestRate.length; j++) 12. interestRate[j] = (STARTRATE + j) / 100.0; 13. 14. double[][] balances = new double[NYEARS][NRATES]; 15. 16. // set initial balances to 10000 17. for (int j = 0; j < balances[0].length; j++) 18. balances[0][j] = 10000; 19. 20. // compute interest for future years 21. for (int i = 1; i < balances.length; i++) 22. { 23. for (int j = 0; j < balances[i].length; j++) 24. { 25. // get last year's balances from previous row 26. double oldBalance = balances[i - 1][j]; 27. 28. // compute interest 29. double interest = oldBalance * interestRate[j]; 30. 31. // compute this year's balances 32. balances[i][j] = oldBalance + interest; 33. } 34. } 35. 36. // print one row of interest rates 37. for (int j = 0; j < interestRate.length; j++) 38. System.out.printf("%9.0f%%", 100 * interestRate[j]); 39. 40. System.out.println(); 41. 42. // print balance table 43. for (double[] row : balances) 44. { 45. // print table row 46. for (double b : row) 47. System.out.printf("%10.2f", b); 48. 49. System.out.println(); 50. } 51. } 52. }

Ragged Arrays

So far, what you have seen is not too different from other programming languages. But there is actually something subtle going on behind the scenes that you can sometimes turn to your advantage: Java has no multidimensional arrays at all, only one-dimensional arrays. Multidimensional arrays are faked as "arrays of arrays."

For example, the balances array in the preceding example is actually an array that contains 10 elements, each of which is an array of six floating-point numbers (see Figure 3-17).

The expression balances[i] refers to the ith subarray, that is, the ith row of the table. It is itself an array, and balances[i][j] refers to the jth entry of that array.

Because rows of arrays are individually accessible, you can actually swap them!

double[] temp = balances[i]; balances[i] = balances[i + 1]; balances[i + 1] = temp;

It is also easy to make "ragged" arrays, that is, arrays in which different rows have different lengths. Here is the standard example. Let us make an array in which the entry at row i and column j equals the number of possible outcomes of a "choose j numbers from i numbers" lottery.

1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 1

Because j can never be larger than i, the matrix is triangular. The ith row has i + 1 elements. (We allow choosing 0 elements; there is one way to make such a choice.) To build this ragged array, first allocate the array holding the rows.

int[][] odds = new int[NMAX + 1][];

Next, allocate the rows.

for (int n = 0; n <= NMAX; n++) odds[n] = new int[n + 1];

Now that the array is allocated, we can access the elements in the normal way, provided we do not overstep the bounds.

for (int n = 0; n < odds.length; n++) for (int k = 0; k < odds[n].length; k++) { // compute lotteryOdds . . . odds[n][k] = lotteryOdds; }

Example 3-9 gives the complete program.

C++ NOTE

Example 3-9. LotteryArray.java

1. public class LotteryArray 2. { 3. public static void main(String[] args) 4. { 5. final int NMAX = 10; 6. 7. // allocate triangular array 8. int[][] odds = new int[NMAX + 1][]; 9. for (int n = 0; n <= NMAX; n++) 10. odds[n] = new int[n + 1]; 11. 12. // fill triangular array 13. for (int n = 0; n < odds.length; n++) 14. for (int k = 0; k < odds[n].length; k++) 15. { 16. /* 17. compute binomial coefficient 18. n * (n - 1) * (n - 2) * . . . * (n - k + 1) 19. ------------------------------------------- 20. 1 * 2 * 3 * . . . * k 21. */ 22. int lotteryOdds = 1; 23. for (int i = 1; i <= k; i++) 24. lotteryOdds = lotteryOdds * (n - i + 1) / i; 25. 26. odds[n][k] = lotteryOdds; 27. } 28. 29. // print triangular array 30. for (int[] row : odds) 31. { 32. for (int odd : row) 33. System.out.printf("%4d", odd); 34. System.out.println(); 35. } 36. } 37. }