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

removing old code

Browse Source
This commit is contained in:
Eugene Fischer
2020-06-17 16:14:40 -05:00
parent a48fbbdb88
commit ce77a6e048
1 changed files with 1 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
Sorting/InsertionSorterLinkedList.java
View File

@@ -13,7 +13,7 @@ public class InsertionSorterLinkedList extends Sorter{
protected void sort(){ protected void sort(){
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 index=0; int index=0;
ListIterator<Integer> iter = numbersLL.listIterator(count); ListIterator<Integer> iter = numbersLL.listIterator();
while(index<numbersLL.size()&&iter.hasNext()){ while(index<numbersLL.size()&&iter.hasNext()){
int value = iter.next(); int value = iter.next();
iter.remove(); iter.remove();
@@ -21,7 +21,6 @@ public class InsertionSorterLinkedList extends Sorter{
int current=value; int current=value;
do{ do{
current = iter.previous(); current = iter.previous();
destIndex++;
}while(compare(current,value)>0 && iter.hasPrevious()); }while(compare(current,value)>0 && iter.hasPrevious());
if(compare(current,value)<0){ if(compare(current,value)<0){
iter.next(); iter.next();