This is the code and my algorithm I’ve written for insertionsort. What do I need to add or fix?
public class InsertionSort {
/** The method for sorting the numbers */
public static void insertionSort(double[] list) {
for (int i = 1; i < list.length; i++) {
/** insert list[i] into a sortedsublist list[0..i-1] so that
list[0..i] is sorted. */
double currentElement =list[i];
int k;
for (k = i – 1; k >= 0 &&list[k] > currentElement; k–) {
list[k + 1] =list[k];
}
// Insert the current elementinto list[k+1]
list[k + 1] = currentElement;
}
}
}
Step 0: Have an array of integers called list
Step
PayPal Gateway not configured
PayPal Gateway not configured