We consider the problem of sorting a set of items having an
unknown total order by doing binary comparisons of the items, given
the outcomes of some pre-existing comparisons. We present a simple
new algorithm with a running time of O(m + n + log T)...
