viff

changeset 880:25d1109d5b60

TODO items: Compare with mergesort and support preprocessing. Maybe also add a progress bar.
author Martin Geisler <mg@daimi.au.dk>
date Fri, 08 Aug 2008 10:54:43 +0200
parents 67a0628c2f83
children 82ff7bfd8b64
files apps/sort.py
diffstat 1 files changed, 7 insertions(+), 0 deletions(-) [+]
line diff
     1.1 --- a/apps/sort.py	Fri Aug 08 10:39:54 2008 +0200
     1.2 +++ b/apps/sort.py	Fri Aug 08 10:54:43 2008 +0200
     1.3 @@ -34,9 +34,16 @@
     1.4  # comparisons of length n + n/2 + n/4 + ... + 1 = 2n - 1, which is
     1.5  # more than the O(log^2 n) stages needed by the Bitonic Sort.
     1.6  #
     1.7 +# TODO: Implement mergesort too to better back this up.
     1.8 +#
     1.9  # See this page for more analysis and a Java implementation:
    1.10  #
    1.11  # http://iti.fh-flensburg.de/lang/algorithmen/sortieren/bitonic/bitonicen.htm
    1.12 +#
    1.13 +# TODO: Predict the number of comparisons and support preprocessing.
    1.14 +#
    1.15 +# TODO: With the number comparisons known we could provide a progress
    1.16 +# bar using this library: http://pypi.python.org/pypi/progressbar/
    1.17  
    1.18  # Give a player configuration file as a command line argument or run
    1.19  # the example with '--help' for help with the command line options.