/*
Object[] object1 = null ; //数组定义
Vector<Object> object2;//Vector定义
object2 = new Vector<Object>(Arrays.asList(object1));// array -> vector
object1 = object2 .toArray( new Object[object2 .size()]);// vector ->array
*/
Integer[] object1={0,10,20,30,40,50,60,70,80,90,100};//数组定义
Vector<Integer> object2;//Vector定义
object2=new Vector<Integer>(Arrays.asList(object1));//[] -> array -> vector
System.err.println(Arrays.toString(object1));
System.err.println(object2);    
Integer[] object3 = object2.toArray(new Integer[object2.size()]);//vector -> array -> []
System.out.println(Arrays.toString(object3));

首先是将Vector转换为数组，然后再用冒泡排序，去找到最小的值，然后交换。代码如下：

1. public static Elem[] getSort(Elem[] keys) {  
2.   
3.         for (int i = 0; i < keys.length - 1; i++) {  
4.             for (int j = 0; j < keys.length - i - 1; j++) {  
5.                 Elem pre = keys[j];  
6.                 Elem next = keys[j + 1];  
7.                 if (pre.get() > next.get()) {  
8.                     Elem temp = pre;  
9.                     keys[j] = next;  
10.                     keys[j + 1] = temp;  
11.                 }  
12.             }  
13.         }  
14.         return keys;  
15.     }