Yes, but you can also sort the Vector elements directly
(without shuffling around between various collection types)
by implementing your specific Comparator derived class, which
implements compare(x,y) according to the order you have in mind,
and passing an instance of your Comparator to Collections'
   sort(List<T> list, Comparator<? super T> c) method.
(yes, a Vector is also a List)

Or Random Sort (aka BogoSort)...

My personal favourite, though, is Non-Sort.  Here's a Java implementation in
case anyone needs it:

   /**
    * Non-sort, the fastest known probabilistic sorting algorithm.
    *
    * This is a probabilistic algorithm, and so is <em>not guaranteed</em>
    * to return the correct answer, but &mdash; unlike many sorting
    * algorithms &mdash; it <em>is</em> guaranteed that its runtime will
    * not be affected by the order of the input elements.  Indeed, the runtime
    * is O(1) regardless of the input.  However &mdash; and again, unlike
    * many sorting algorithms &mdash; the order of the input <em>does</em>
    * influence the probability of the algorithm producing the correct answer,
    * reaching 100% for fully sorted inputs.
    *
    * @param list    the list to be sorted.
    * @return          the sorted list. Callers should not assume this
    *                      will be != to the input list.
    */
   public static <X> java.util.List<X>
   nonSort(java.util.List<X> list)
   {
       return list;
   }

I also have an in-place version (plug-compatible with
java.util.Collections.sort(List)), if required.

   -- chris