Re: Binqry Tree sort

Thanks chuck for your advices. I'll obey from those rules.
and second about the algorithm which I asked.
Actually I'm looking for a parallel proessing, not a sequential
proessing with just one processor. Assume each node of a tree as a
processor. The connection between processors are like the binary tree.
In other words I want to use the binary tree as my parallel
architecture.

For example if you want to find the minimum value of a set you should
simply put the values on the leaves. Then each processor sends its
values to the parent processor. The parent processor compares the
values received from its children. And stores the minimum one and sents
it to the top (again to its parent). This manner contues. then after
t(n) = O(logn) you will have the min value at the root processor.

Now I'm looking for a parallel algorithm wich uses parallel binary tree
architecture for sorting the elements on a set on the leaves.

Actually I want to do this to find the Kth min element on the set. I
can do it by using the above algorithm which I expained in t(n) = O( k
+ logn ).
Now I want to do it by sort for evaluating their differences in t(n).
Is it clear now?
Thanks
Nejla

.

Relevant Pages

  • Re: Binqry Tree sort
    ... second about the algorithm which I asked. ... Actually I'm looking for a parallel proessing, not a sequential proessing with just one processor. ... In other words I want to use the binary tree as my parallel architecture. ... "If you want to post a followup via groups.google.com, don't use the broken "Reply" link at the bottom of the article. ...
    (comp.programming)
  • Re: Binqry Tree sort
    ... and second about the algorithm which I asked. ... Actually I'm looking for a parallel proessing, ... The connection between processors are like the binary tree. ... Hmm, does each processor have its own tiny memory space, and do they ...
    (comp.programming)
  • Re: Suitable Data Structure?
    ... >implement the following algorithm effectively: ... The precise components jof v that will ... >Simply selecting the largest element in requires Ooperations, ... >course, O, which could be obtained if a binary tree could be used. ...
    (sci.math.num-analysis)
  • Monotone Decomposition
    ... It's the first step in the classic Otriangulation algorithm. ... During the plane-sweep some of the active edges are stored in a binary tree or similar Osearch-structure. ... I have no idea how the search for the rightmost edge should work. ... The only reliable way to get the rightmost intersection-point seems to calculate the intersections and compare them. ...
    (comp.graphics.algorithms)
  • Suitable Data Structure?
    ... implement the following algorithm effectively: ... The precise components jof v that will ... Simply selecting the largest element in requires Ooperations, ... course, O, which could be obtained if a binary tree could be used. ...
    (sci.math.num-analysis)