Notes.

diff --git a/PLAN b/PLAN
index 065eec9fb2ff2044afcd275e5781e4c704d771cf..93e5940e33fb1102e1705e0cb0a31914a69c777d 100644 (file)
--- 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 47c2713d36fb4659d024d12ebd4b61a82dd7c20c..aa0166475bf944c2a4b59aaeefe9dd69cefb7010 100644 (file)
--- 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