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 wrap: on
line diff
--- a/apps/sort.py	Fri Aug 08 10:39:54 2008 +0200
+++ b/apps/sort.py	Fri Aug 08 10:54:43 2008 +0200
@@ -34,9 +34,16 @@
 # comparisons of length n + n/2 + n/4 + ... + 1 = 2n - 1, which is
 # more than the O(log^2 n) stages needed by the Bitonic Sort.
 #
+# TODO: Implement mergesort too to better back this up.
+#
 # See this page for more analysis and a Java implementation:
 #
 # http://iti.fh-flensburg.de/lang/algorithmen/sortieren/bitonic/bitonicen.htm
+#
+# TODO: Predict the number of comparisons and support preprocessing.
+#
+# TODO: With the number comparisons known we could provide a progress
+# bar using this library: http://pypi.python.org/pypi/progressbar/
 
 # Give a player configuration file as a command line argument or run
 # the example with '--help' for help with the command line options.