array

[bharath pawan]

how to reverse an array with out using indexing

[Garrett Rowe]

Please explain what you mean by "with out using indexing".

[Campbell Ritchie]

Somebody is having you on, surely?

How are you expected to gain access to the elements of an array other than by using their index?
If you have two indices to an array, let's call them i and j, it is very easy to swap the two, with a method like this.

public static void swapPair(int [] array, int i, int j)
{
   System.out.println("You didn't think I'd give you the solution, did you?");
}//end swap pair

. . . and once you have got that working it is easy to use that method to reverse the whole array. But I can't think how you are supposed to do it without using the index.

[Rob Spoor]

You could do this in C(++) because of pointer arithmetic, but in Java that doesn't exist.

[Paul Clapham]

Suggested framework:

1. Copy the array to a List (using Arrays.asList)

2. Create a Stack from that List.

3. Create a new empty Stack.

4. Pop entries from the first Stack and push them into the second Stack.

5. Make the second Stack into an array (using List.toArray).

[Guido Sautter]

If we're already converting the array into some sort of Java Collection, maybe java.util.Collections provides some useful methods ...