simplifying iterator use

Sorting/InsertionSorterLinkedList.java

@@ -12,19 +12,26 @@ public class InsertionSorterLinkedList extends Sorter{
 
     protected void sort(){
         LinkedList<Integer> numbersLL = new LinkedList<Integer>(Arrays.asList(numbers));//make a linked list from numbers array
-        int count=0;
+        int index=0;
         ListIterator<Integer> iter = numbersLL.listIterator(count);
-        while(count<numbersLL.size()){
+        while(index<numbersLL.size()&&iter.hasNext()){
             int value = iter.next();
             iter.remove();
             if(iter.hasPrevious()){
-                int current;
+                int current=value;
                 do{
                     current = iter.previous();
-                }while(current>value);
+                    destIndex++;
+                }while(compare(current,value)>0 && iter.hasPrevious());
+                if(compare(current,value)<0){
+                    iter.next();
+                }
             }
             iter.add(value);
-            count++;
+            while(iter.nextIndex()<=index){
+                iter.next();
+            }
+             index++;
         }
         /*
         for(int i=0;i<numbers.length;i++){