[net.math] Sorting a sorted list by a different

ron@inmet.UUCP (06/19/85)

/**** inmet:net.math / siemens!haahr /  2:45 pm  Jun  7, 1985 ****/
Given a list sorted by keys k1, k2 is there a fast (i.e., better than
n log n) method for sorting it by keys k2, k1?  A stable sort on k2
(one that preserves order when keys are equal) or merge where each run
is the sequence of values with k1 equal are both n log n.  Is there
anything I'm missing that will take advantage of the fact that the k1's
are already ordered?

			-- Paul Haahr
			..!{allegra,ihnp4}!princeton!{jendeh,siemens}!haahr
-- 

			-- Paul Haahr
			..!{allegra,ihnp4}!princeton!{jendeh,siemens}!haahr
/* ---------- */