7. Rewrite the following Java code for Insertion Sort so that it will sort any Object...

Transcribed Image Text:

7. Rewrite the following Java code for Insertion Sort so that it will sort any Object that implements the Comparable interface: public static int[] insertionSort (int array(1) { int [1 n = array; int in, out, temp; for (out = 1; out <n.length; out++) { temp n[out]; in = out; while (in 0 && n[in 11 >= temp) ( n[in] =n[in - 11; in--; } n[in temp; } Return n; 7. Rewrite the following Java code for Insertion Sort so that it will sort any Object that implements the Comparable interface: public static int[] insertionSort (int array(1) { int [1 n = array; int in, out, temp; for (out = 1; out <n.length; out++) { temp n[out]; in = out; while (in 0 && n[in 11 >= temp) ( n[in] =n[in - 11; in--; } n[in temp; } Return n;

Answer rating: 100% (QA)

Ill help you with an example of how you can create a generic insertion sort method in Java that sort... View the full answer