efischer/Tutoring-APCompSci
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

More iterator stuff

Browse Source
This commit is contained in:
Eugene Fischer
2020-06-17 14:43:47 -05:00
parent 2b2097c7d2
commit 3fe9324606
1 changed files with 12 additions and 12 deletions
Download Patch File Download Diff File Expand all files Collapse all files

24
Sorting/InsertionSorterLinkedList.java
View File

@@ -14,18 +14,18 @@ public class InsertionSorterLinkedList extends Sorter{
LinkedList<Integer> numbersLL = new LinkedList<Integer>(Arrays.asList(numbers));//make a linked list from numbers array LinkedList<Integer> numbersLL = new LinkedList<Integer>(Arrays.asList(numbers));//make a linked list from numbers array
int countOuter=0; int countOuter=0;
while(countOuter<numbersLL.size()){ ListIterator<Integer> iter = numbersLL.listIterator(count);
ListIterator<Integer> outerIterator = numbersLL.listIterator(countOuter); while(count<numbersLL.size()){
int value = numbersLL.get(countOuter); iter.next();
ListIterator<Integer> innerIterator = numbersLL.listIterator(); int value = iter.remove();
int current, countInner; if(iter.hasPrevious()){
countInner = 0; int current;
do{ do{
current = innerIterator.next(); current = iter.previous();
countInner++; }while(current>value);
}while(countInner<=countOuter && compare(value, current)>0); }
numbersLL.add(innerIterator.previousIndex(), numbersLL.remove(countOuter)); iter.add(value);
countOuter++; count++;
} }
/* /*
for(int i=0;i<numbers.length;i++){ for(int i=0;i<numbers.length;i++){