InsertionSort.java

Go to the documentation of this file.

package sorting;

import java.awt.*;

public class InsertionSort extends Sort
{

  protected void doSort()
  {
    int pos;
    for (int i = 1; i <= theArray.length - 1; i++)
    {
      pos = binsearch(theArray, 0, i - 1, theArray[i]);
      move(i, pos, theArray);
      this.showArray();
      this.theLabel.setText(this.calcRuntime()+"ms");
      this.theLabel.validate();
    }
  }

  private void move(int i, int j, int[] a)
  {
    int tmp = a[i];
    for (int g = i; g >= j + 1; g--)
    {
      a[g] = a[g - 1];
    }
    a[j] = tmp;
  }

  private int binsearch(int[] a, int low, int high, int x)
  {
    int middle = 0;
    while (low <= high)
    {
      middle = (low + high) / 2;
      if (a[middle] == x) return middle;
      else if (a[middle] < x) low = middle + 1;
      else if (a[middle] > x) high = middle - 1;
    }
    return low;
  }

}

---