Streets.java
1    package arraylistplay;
2    
3    //ANALOGY OF PRIMES ARRAY PROGRAM
4    
5    public class Streets {
6    
7        public static void main(String[] args) {
8    
9            String[] streets = new String[12];
10   
11           streets[0] = "Iberville";
12           streets[1] = "Dectaur";
13           streets[2] = "Toulouse";
14           streets[3] = "Bourbon";
15           streets[4] = "Dauphine";
16           streets[5] = "Royal";
17           streets[6] = "St Ann";
18           streets[7] = "St Peter";
19           streets[8] = "Conti";
20           streets[9] = "Exchange";
21           streets[10] = "Bienville";
22           streets[11] = "Dumaine";
23   
24           System.out.println("length of primes array = " + streets.length);
25           System.out.println("first prime = " + streets[0]);
26           System.out.println("last prime = " + streets[11]);
27           System.out.println("last prime = " + streets[streets.length - 1]);
28           System.out.println("\nThe initial array ...");
29           int i = 0;
30           while (i < streets.length) {
31               System.out.println(streets[i]);
32               i = i + 1;
33           }
34   
35           String temp = streets[0];
36           streets[0] = streets[streets.length - 1];
37           streets[streets.length - 1] = temp;
38   
39           System.out.println("\nThe final array ...");
40           for (int x = 0; x < streets.length; x = x + 1) {
41               System.out.println(streets[x]);
42           }
43   
44       }
45   }
46   
47