Abstract The (k, r)-Quicksort on the fly is a sorting algorithm, which provides successively first the smallest, then the second smallest and so on of a given set of seize n. Let X (n, l) be the …
An exponential recursive ternary trees (ERTTs) have the property that each node has 3 possible places (external nodes) to which a child can be attached. At each step of growing of …
An exponential recursive ternary trees (ERTTs) have the property that each node has 3 possible places (external nodes) to which a child can be attached. At each step of growing of …