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

Eliminated swap counting, got bubble, selection, and insertion sort working

Browse Source
This commit is contained in:
eugenefischer
2020-05-31 09:49:28 -05:00
parent c680ec7671
commit 4574231dcb
15 changed files with 1111303 additions and 75 deletions
Download Patch File Download Diff File Expand all files Collapse all files

33
Sorting/InsertionSorter.java
View File

@@ -1,7 +1,7 @@
package Sorting;
//import java.util.Arrays;
//import java.util.List;
import java.util.Arrays;
import java.util.List;
public class InsertionSorter extends Sorter{
@@ -13,30 +13,19 @@ public class InsertionSorter extends Sorter{
int insertionValue;
for(int i=1;i<numbers.length;i++){
insertionValue=numbers[i];
insert(i, insertionValue);
int j=i-1;
while(j>=0 && compare(numbers[j],insertionValue)>0){
numbers[j+1]=numbers[j];
j--;
}
numbers[j+1]=insertionValue;
}
}
private void insert(int index, int ins){
for(int i=index-1;i>=0;i--){
int comp = compare(ins,numbers[i]);
if(comp<0){
if(i==0){
numbers[i+1]=numbers[i];
numbers[i]=ins;
}
else{
numbers[i+1]=numbers[i];
}
}
else{
numbers[i+1]=ins;
}
}
}
/*
*This method uses a List for simple insertion
*But I want to go C-style and just do array manipulation
//This method uses a List for simple insertion
//But I want to go C-style and just do array manipulation
void sort(){
List<Integer> nums = Arrays.asList(numbers);
for(int i=1;i<nums.size();i++){