Next: The User Interface Up: Benchmarks Previous: Naive Fibonacci

Quicksort

For quicksort applied to a list with 200 elements, the following internal run times were measured:

The speed up achieved by indexing is only 1.13, whereas the the speed up achieved by transformation into LL is 1.92 (compared with the indexed version).


Harold Boley & Michael Sintek (sintek@dfki.uni-kl.de)