1    /* Program to write a street program by analogy with the primes program 
2     */
3    
4    package arrayplay;
5    
6    public class Streets {
7    
8        public static void main(String[] args) {
9    
10           String[] streets = new String[12];
11   
12           streets[0] = "Iberville";
13           streets[1] = "Decatur";
14           streets[2] = "Toulouse";
15           streets[3] = "Bourbon";
16           streets[4] = "Dauphine";
17           streets[5] = "Royal";
18           streets[6] = "St Ann";
19           streets[7] = "St Peter";
20           streets[8] = "Conti";
21           streets[9] = "Exchange";
22           streets[10] = "Bienville";
23           streets[11] = "Dumaine";
24   
25           System.out.println("length of streets array = " + streets.length);
26           System.out.println("first streets  = " + streets[0]);
27           System.out.println("last streets  = " + streets[11]);
28           System.out.println("last streets = " + streets[streets.length-1]);
29   
30           System.out.println("\nThe initial array...");
31           int i = 0;
32           while (i < streets.length ) {
33               System.out.println(streets[i]);
34               i=i+1;
35           }
36   
37            String count = streets[0];
38           streets[0] = streets[streets.length-1];
39          streets[streets.length-1] = count;
40   
41           System.out.println("\nThe final array...");
42           for (int x = 0; x < streets.length; x = x+1) {
43               System.out.println(streets[x]);
44   
45   
46           }
47       }
48   }
49