Answer to Question #149385 in Algorithms for Madu

Question

public void ppp( Object [ ] data ){
int i,j;
for (j = 0; i < data.length-1; i++)
for (j = data.length-1; j>i;--j)
If (((comparable)data[ jj ]).compareTo (data[j-1]) < 0 )
Swap(data,j,j-1);
}

What is the above java code segment intended to do?
Select one or more:
A. selection sort algorithm
B. quick sort algorithm
C. insertion sort algorithm
D. bubble sort algorithm
E. radix sort algorithm

Answer 1

Dear Madu, your question requires a lot of work, which neither of our experts is ready to perform for free. We advise you to convert it to a fully qualified order and we will try to help you. Please click the link below to proceed: Submit order