public static void sort(Sortable data) {
    quickSort(data, 0, data.size() - 1);
  }
@Test
  public void testSort() {
    int[] expected = new int[200];
    int[] actual = new int[expected.length];
    for (int i = 0; i < expected.length; i++) {
      expected[i] = (int) (Math.random() * 900);
      actual[i] = expected[i];
    }
    Arrays.sort(expected);
    DataUtils.sort(new SimpleSortable(actual, actual.length));
    assertThat(actual, equalTo(expected));
  }