Unless you need the data structure to be synchronized between threads
rather use an ArrayLists instead of a Vectors as Vectors are
synchronized.

This code should do what you are describing but I dont think its a good
idea - very clunky and possibly error prone.

import java.util.ArrayList;
import java.util.List;

public class A {

   public static void main(String[] args){
       List list = new ArrayList();
       for (int i = 0; i < 10; i++){
           list.add(new ArrayList());
       }

       for (int i = 0; i < 10; i++){
           ((List)list.get(i)).add(String.valueOf(i));
       }

       System.out.println(list);
   }
}

How do you want to process the data stored in this structure? Do you
want to iterate over entire rows/columns or select individual items at
particular indexes [x,y] ?

If the latter then take a look at the MultiKeyMap in the commons
collections libs.

Chris

Well, I wouldn't do it like that. If you want to have it grow dynamically
then a vector or list of vectors would suit you better. If you do want to
define an array of vectors, then it's defined just like any other array.