This will get you using your head.

Question

Hi,
I am trying to convert a search algorithm so it will iterate one step at a time every time the method is called instead of doing the whole sort at once. I have done it with a bubble sort
FROM:
     public static void bubble(int bNumbers[])
          int i, j, temp;
          for (i = (bNumbers.length - 1); i >= 0; i--)
               for (j = 1; j <= i; j++)
                    if (bNumbers[j-1] > bNumbers[j])
                         temp = bNumbers[j-1];
                         bNumbers[j-1] = bNumbers[j];
                         bNumbers[j] = temp;
     }INTO
     public static void bubble(int bNumbers[])
          if(jB != 10)
               int temp;
               if (bNumbers[jB-1] > bNumbers[jB])
                    temp = bNumbers[jB-1];
                    bNumbers[jB-1] = bNumbers[jB];
                    bNumbers[jB] = temp;
               if(jB==iB)
                    jB=0;
                    iB--;
               jB++;
     }I am trying to do the same with an insertion sort. I have been trying for the last 2 hours and it is reallying starting to annoy me. Can anyone have a go.
Insertion Sort algorithm:
     public static void insertion(int iNumbers[])
          int i, j, index;
          for (i=1; i < iNumbers.length; i++)
               index = iNumbers;
               j = i;
               while ((j > 0) && (iNumbers[j-1] > index))
                    iNumbers[j] = iNumbers[j-1];
                    j = j - 1;
               iNumbers[j] = index;
Thanks
John Cleary.

Answer 1

Sounds like a producer-consumer scenario. I have done some animation out of some graph algorithms, and here is what I did for a step-by-step execution.
I used a separate thread for the algorithm, and it checked a flag to see if the user wanted step by step execution, and if so it waited on a lock. When the user signaled for another step, it was just
lock.notify();
Is that ok for you?