Class QuickSortTest

src/test/java/com/rtg/util/QuickSortTest.java:39–86

Test Class

 * Test Class
 */
public class QuickSortTest extends TestCase {


  public void testSort() {
    final PortableRandom pr = new PortableRandom();
    final long seed = pr.getSeed();
    try {
      final int[] unsorted = new int[100000];
      for (int i = 0; i < unsorted.length; ++i) {
        unsorted[i] = Math.abs(pr.nextInt());
      }
      final int[] unsorted2 = Arrays.copyOf(unsorted, unsorted.length);
      final QuickSort.SortProxy proxy = new QuickSort.SortProxy() {

        @Override
        public int compare(long index1, long index2) {
          return Integer.compare(unsorted[(int) index1], unsorted[(int) index2]);
        }

        @Override
        public void swap(long index1, long index2) {
          final int temp = unsorted[(int) index1];
          unsorted[(int) index1] = unsorted[(int) index2];
          unsorted[(int) index2] = temp;
        }

        @Override
        public long length() {
          return unsorted.length;
        }

        @Override
        public String toString() {
          return Arrays.toString(unsorted);

        }

      };
      QuickSort.sort(proxy);
      Arrays.sort(unsorted2);
      assertTrue(Arrays.equals(unsorted2, unsorted));
      assertTrue(QuickSort.isSorted(proxy));
    } catch (RuntimeException e) {
      throw new RuntimeException("Seed: " + seed + " has discovered an error", e);
    }
  }

}