About Collections class

Question

The Collections Framework defines several algorithms that can be applied to collections
and maps.These algorithms are defined as static methods within the Collections class.
These algorithms support List,Map,Set,Enumeration,SortedMap,SortedSet.But not
Iterator.
Is it fixed by Java that no Iterator can use within any of those algorithms of Collections
class?
Or, Is it only Maps class support Iterator for it's algorithms?

Answer 1

Thanks everybody for replies.
import java.util.*;
public class AlgorithmsDemo {
     public static void main(String[] args) {
          LinkedList<Integer> ll=new LinkedList<Integer>();
          System.out.println("Size of LinkedList ll: "+ll.size());
          System.out.println("Contents of LinkedList ll: "+ll);
          ll.add(-8);
          ll.add(20);
          ll.add(-20);
          ll.add(8);
          System.out.println("Now the size of linkedList ll: "+ll.size());
          System.out.println("Now the contents of linkedlist ll: "+ll);
          Comparator<Integer> comp=Collections.reverseOrder();
          Collections.sort(ll,comp);
          System.out.print("List sorted in reverse: ");
          for(int i:ll)
               System.out.print(i+" ");
          System.out.println();
          Collections.shuffle(ll);
          System.out.print("List shuffled: ");
          for(int i:ll)
               System.out.print(i+" ");
          System.out.println();
          System.out.println("Minimum: "+Collections.min(ll));
          System.out.println("Maximum: "+Collections.max(ll));
}If I want to use Iterator instead of Comparator then what changes need to do
within above code?