From: Martin Mares <mj@ucw.cz>
Date: Wed, 30 Jan 2008 22:21:04 +0000 (+0100)
Subject: Notes.
X-Git-Tag: printed~261
X-Git-Url: http://mj.ucw.cz/gitweb/?a=commitdiff_plain;h=e8f01fd0e7c2a6bb00394cf9ca046ecab173f85b;p=saga.git

Notes.
---

diff --git a/PLAN b/PLAN
index 065eec9..93e5940 100644
--- a/PLAN
+++ b/PLAN
@@ -9,6 +9,7 @@
 *  Fine Details of Computation
 
   o  Models and machines
+  o  Radix-sorting
   .  Bit tricks
   .  Ranking sets
   .  Bitwise B-trees
@@ -50,6 +51,8 @@ TODO:
 - mention disconnected graphs
 - Euclidean MST
 - Some algorithms (most notably Fredman-Tarjan) do not need flattening
+- mention in-place radix-sorting?
+- ranking of permutations on general sets, relationship with integer sorting
 
 Notation:
 
diff --git a/ram.tex b/ram.tex
index 47c2713..aa01664 100644
--- a/ram.tex
+++ b/ram.tex
@@ -280,4 +280,8 @@ scanning all~$n$ buckets takes $\O(n+m)$ time.
 
 \FIXME{Add an example of locally determined orders, e.g., tree isomorphism?}
 
+%--------------------------------------------------------------------------------
+
+\section{Bits and vectors}
+
 \endpart