Finish the java code.(this is for insertion sorting)

Question

public class RecursiveInsertionSorting

{ public static void sort(int[ ] data) {

sort(data, __);

}

private static void sort(int[] data, int endIndex) {

if(endIndex==data.length) _____;

int i;

int temp = data[ ______ ];

for(i=endIndex-1; i>=0; i--) {

if(data[i]>temp) data[i+1] = data[i];

else break;

else break; } data[i+1] = _______;

__________________;

}

}

Answer 1

public class RecursiveInsertionSorting

{

public static void Sort(int[ ] data)

{

sort(data,1);

}

private static void sort(int[] data, int endIndex)

{

if (endIndex==data.length) { return; }

int i;

int temp = data[endIndex];

/* Move elements of arr[0..i-1], that are

greater than key, to one position ahead

of their current position */

for (i=endIndex-1; i >= 0; i--)

{

if (data[i]>temp)

data[i + 1] = data[i];

else break;

}

data[i+ 1] = temp;

sort(data,endIndex+1);

}

public static void main (String args[])

{

int data[] = { 24,12,18,16,2,13,11,19,15,17,10,7,21,5,20,6,3,9,4,22,8,23};

RecursiveInsertionSorting x = new RecursiveInsertionSorting();

x.Sort(data);

for (int iLoop=0; iLoop<data.length; iLoop++)

{

System.out.println(data[iLoop]);

}

}

}