Re: Am I abusing SORT? It sure ain't working for me....

On Mon, 27 Feb 2006 00:10:29 GMT, Kenny Tilton
<NOktiltonSPAM@xxxxxxxxxx> wrote:

OK, I am missing transitivity. And I can fix that by imposing a tougher
sort than the application requires (traversal order).

If you have to traverse a big set of nodes to find the traversal order
of a small subset, and you would rather just sort that small subset,
you might want to have each node remember its depth, which would be
defined as being one greater than the depth of its deepest parent.
Then you could simply sort by depth, with no need for traversal.

.

Relevant Pages

  • Re: New Congestion Charge - Excellent news!
    ... >> Meanwhile having the strange idea that they have some sort of prior claim ... >> on land they traverse to extent of demanding that anyone else (locals, ...
    (uk.transport)
  • Re: Disk Volumes Question
    ... raggio wrote: ... table of some sort? ... I am able to traverse the files in finder for "Extern120 1". ...
    (comp.sys.mac.system)
  • Re: Disk Volumes Question
    ... raggio wrote: ... table of some sort? ... I am able to traverse the files in finder for "Extern120 1". ...
    (comp.sys.mac.system)
  • Re: Nested sorting problem with linked list
    ... Independently sort the individual parts of the list having ... my previous post) you traverse the list with one node look-ahead. ... traverse further and find the last node of the second segment, ... welcome to clc: http://www.ungerhu.com/jxh/clc.welcome.txt ...
    (comp.lang.c)