Problem Based Benchmark Suite

almostSorted Data Generator:

almostSorted [-r <m>] -t {int,double} <n> <filename>

This generator creates a sequence of n almost sorted values in the sequence file format. In particular it generates a sorted sequence of length n and then randomly swaps m pairs. If the -r argument is not specified the default is m = sqrt(n). For both the int and double type the sorted sequence is 0, 1, .., (n-1).

last modified 15:18, 05 Jun 2012

This project has been funded by the following sources:
Intel Labs Academic Research Office for the Parallel Algorithms for Non-Numeric Computing Program,
National Science Foundation, and
IBM Research.