code: public void rsort ()
      {
          sort(new Comparator<T>() {
              public int compare (T o1, T o2) {
                  return _comp.compare(o2, o1);
              }
          });
      }
docs: Sorts the elements in this list using the quick sort algorithm
  according to their reverse natural ordering. The elements must
  implement {@link Comparable} and all be mutually comparable.