Instead of comparing values pointed to by the pointers in statements like this if (n->me < curr->me) you are comparing pointers themselves. You should rewrite the condition like if ( *n->me < *curr->me ) solved insertion sort using linked list and pointers
Your current method is … not quite right, for any kind of sort. Insertion sort would take an element and insert it at the correct index, then shift the already inserted items down appropriately. Something like void looper(int *p) { for (int i = 1;i < 25;i++) { int key = p[i]; int j = … Read more
You are not passing the array object to sort method. Try the following code: public class SortTest { public void sort(String[] array) { String insert; for (int next = 1; next < array.length; next++) { insert = array[next]; int moveItem = next; while (moveItem > 0 && array[moveItem – 1].compareTo(insert) > 0) { array[moveItem] = … Read more
The problem wasn’t that you were giving a wrong answer, it’s that you weren’t giving the coding solution they were expecting. On this particular problem, there’s a “hint” section in the upper right hand corner. If you click on the What’s this? link. This hint shows the code you’ll need to successfully complete this step, … Read more