Selection Sort type iteration with LinkedList

Question

Hi,
It seems like Java's ListIterator isn't especially great for doing a "compare every element to every other element" traversion (like the type used in selection sort).
For example, this code works fine:
for(ListIterator<T> i = list.listIterator(); i.hasNext();) {
     T a = i.next();
     for(ListIterator<T> j = list.listIterator(j.nextIndex()); j.hasNext();)
          compare(a, j.next());
}But LinkedList.listIterator(int) is a really poor choice because the iterator has to start at one end and make its way towards the middle before it's returned. So it's not very fast.
I would do this:
for(ListIterator<T> i = list.listIterator(); i.nextIndex() < list.size()-1;) {
     T a = i.next();
     ListIterator<T> j = i.clone();
     for(j.next(); j.hasNext();)
          compare(a, j.next());
}except that ListIterator.clone() isn't defined. There's also no copy constructor like in C++.
Any ideas?

Answer 1

Another reason not to use iterators. I don't know
what those "structural modifications" are but they
are likely to make the iterators fail via
ConcurrentModificationException.
Yeah, I figured that one out pretty quickly.
And just another comment: you seem to be allowing
your brain to be fogged by the idea of choosing the
fastest method. The result of this is that you don't
get any working methods at all. Don't optimize yet.That's valid. I actually have it working now, but based on the (minimal) experience I've had I always pick the most appropriate collection and then work it out from there.
Something inside me dies whenever I see remove(0) called on a long ArrayList.