 Previous Article in Journal
Parameter Estimation, Robust Controller Design and Performance Analysis for an Electric Power Steering System
Previous Article in Special Issue
Space-Efficient Fully Dynamic DFS in Undirected Graphs
Article

# A Selectable Sloppy Heap

Department of Computer Science, University of Wisconsin—Milwaukee, Milwaukee, WI 53201, USA
Algorithms 2019, 12(3), 58; https://doi.org/10.3390/a12030058
Received: 20 November 2018 / Revised: 14 February 2019 / Accepted: 28 February 2019 / Published: 6 March 2019

## Abstract

We study the selection problem, namely that of computing the ith order statistic of n given elements. Here we offer a data structure called selectable sloppy heap that handles a dynamic version in which upon request (i) a new element is inserted or (ii) an element of a prescribed quantile group is deleted from the data structure. Each operation is executed in constant time—and is thus independent of n (the number of elements stored in the data structure)—provided that the number of quantile groups is fixed. This is the first result of this kind accommodating both insertion and deletion in constant time. As such, our data structure outperforms the soft heap data structure of Chazelle (which only offers constant amortized complexity for a fixed error rate $0 < ε ≤ 1 / 2$ ) in applications such as dynamic percentile maintenance. The design demonstrates how slowing down a certain computation can speed up the data structure. The method described here is likely to have further impact in the field of data structure design in extending asymptotic amortized upper bounds to same formula asymptotic worst-case bounds.

## 1. Introduction

Together with sorting, selection is one of the most widely used procedures in computer algorithms. Given a sequence A of n numbers and an integer (selection) parameter $1 ≤ i ≤ n$, the selection problem asks to find the ith smallest element in A. Sorting trivially solves the selection problem; however, a higher level of sophistication is required by a linear time algorithm. A now classic approach for selection [1,2,3,4,5] from the 1970s is to use an element in A as a pivot to partition A into two smaller subsequences and recurse on one of them with a (possibly different) selection parameter i.
The time complexity of this kind of algorithm is sensitive to the pivots used. If a good pivot is used, many elements in A can be discarded, while if a bad pivot is used, the size of the problem may be only reduced by a constant in the worst case, leading to a quadratic worst-case running time. However carefully choosing a good pivot can be time consuming. Choosing the pivots randomly (and thus without much effort) yields a well-known randomized selection algorithm with expected linear running time; see e.g.,  Ch. 9.2, or  Ch. 13.5; or , Ch. 3.4, however its worst case running time is quadratic in n.
The first deterministic linear time selection algorithm Select is due to Blum et al. ; it is recursive in nature. By using the median of medians of small disjoint groups of the input array (of constant size at least 5), good pivots that reduce the size of the problem by a constant fraction and thereby lead to $O ( n )$ time overall can be chosen at low cost in each recursive invocation. More recently, several variants of Select with groups of 3 and 4, also running in $O ( n )$ time, have been obtained by Chen and Dumitrescu and independently by Zwick; see . The selection problem, and computing the median in particular, are in close relation with the problem of finding the quantiles of a set.
Quantiles. The kth quantiles of an n-element set are the $k − 1$ order statistics that divide the sorted set in k equal-sized groups (to within 1). It is known that the kth quantiles of a set can be computed by a recursive algorithm running in $O ( n log k )$ time (, p. 223). Such an algorithm can be modified, if needed, so that the k groups can be also output, say, each as a linked list, within the same overall time. For $2 ≤ i ≤ k − 1$, the ith group of elements (bounded by the $( i − 1 )$th and the ith quantile) is referred to as the ith quantile group; the first quantile group consists of the elements less than or equal to the first quantile, and the kth quantile group consists of the elements greater than or equal to the $( k − 1 )$th quantile.
The following problem has been devised by Fredman about 25 years ago for a graduate algorithms course. This paper both generalizes and strengthens that result.
A “very sloppy heap” (abbreviated vsh) is a data structure for performing the following operations on a set S: (i) insert and (ii) delete-small. The latter operation deletes (and returns) an element x which is among the $⌈ n / 2 ⌉$ smallest elements in the set, where n is the current size of the set. Explain how to implement a vsh in constant amortized time per operation.
Our main result is the following; for the optimality of the dependence on k, see the first remark in Section 4.2.
Theorem 1.
For any fixed integer k, a data structure for dynamic sets exists accommodating each of the following operations in constant time (that depends on k): (i)Inserta new element and (ii)Delete(and return) an element of the ith quantile group of the current set, where $1 ≤ i ≤ k$. The time per operation is $O ( log k )$, which is optimal in a comparison-based model even in an amortized setting.
Background and related problems. Since the selection problem is of primary importance, the interest in selection algorithms has remained high ever since; see for instance [2,5,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24]. In particular, determining the comparison complexity for computing various order statistics including the median has led to many exciting questions, some of which are still unanswered today; in this respect, Yao’s hypothesis on selection (, Ch. 4) remains an inspiring endeavor [4,15,23]. A comprehensive review of early developments in selection is provided by Knuth . Computational results on the exact comparison complexity of finding the ith smallest out of n for small $i , n$, have been obtained in [18,27]. We also refer the reader to the dedicated book chapters on selection in [6,7,28,29,30] and the more recent articles [9,31,32], including experimental work .
The selection problem is also of interest in an online or dynamic setting, where elements are inserted or deleted. A balanced binary search tree on n distinct elements can be augmented with a size attribute for each node, thereby allowing the retrieval of an element of a given rank in $O ( log n )$ time (, Ch. 14). We say that the ith smallest element has rank i, where $i = 1 , … , n$, with ties broken arbitrarily. Further, determining the rank of an element in the data structure can also be done in $O ( log n )$ time. Consequently, a dynamic order statistic operation (inserting a new element or deleting an element of a given rank) can be accomplished within the same time bound.
Priority queues (heaps in particular) are ubiquitous data structures; a typical operation set might include Insert, Delete-Min, Decrease-Key (and perhaps also Find-Min, Increase-Key, or other operations). See for instance  and the references therein for some new variants and recent developments.
A variant of a priority queue that allows dynamic maintenance of percentiles is the soft heap data structure due to Chazelle ; in addition to Create and Meld, the data structure accommodates Insert, Delete and Findmin (Delete x removes item x). Consider a sequence of $m ≥ n$ operations after its creation, that includes n Insert operations. For any $0 < ε ≤ 1 / 2$, a soft heap with error rate $ε$ supports each operation in constant amortized time, except for Insert which takes $O ( log 1 / ε )$ amortized time. The data structure ensures that at most $ε n$ of its items are corrupted (their keys have been artificially raised). Findmin returns the minimum current key (which might be corrupted). In contrast, our data structure uses $O ( log 1 / ε )$ time per operation, where $ε ∼ 1 / k$, and thereby outperforms the soft heap with respect to the worst-case time per update (insert or delete) operation.
Definition 1.
Let k be a fixed positive integer. A “selectable sloppy heap” (abbreviated ssh) is a data structure for performing the following operations on a set S with n elements:
(a)
Insertx: a new elementxis inserted.
(b)
Deletei: this deletes (and returns) some unspecified elementxwhich belongs to theith quantile group of the current set, where$1 ≤ i ≤ k$; if$n < k$, the deleted element is not subject to any requirement.
Outline of the paper. To explain the main challenges and introduce the main ideas, we first sketch several preliminary implementations of the data structure, meeting suboptimal (in k) benchmarks: (i) $O ( k log k )$ amortized time per operation for the first variant in Section 2; (ii) $O ( k log k )$ worst-case time per operation for the second variant in Section 2; (iii) $O ( log k )$ amortized time per operation for the third variant in Section 2. We then further refine these methods in Section 3 to obtain an optimal implementation of the data structure running in $O ( log k )$ worst-case time per operation. In particular, for constant k, the second variant in Section 2 and the (main) variant in Section 3 run in $O ( 1 )$ worst-case time per operation. We conclude in Section 4 with applications and some remarks.
Comments and notations. Duplicate elements are easily handled by the design. Each operation request is associated with a discrete time step, i.e., the jth operation occurs during the jth time step, where $j = 1 , 2 , …$ Without affecting the results, the floor and ceiling functions are omitted in the descriptions of the algorithms and their analyses.
Let A be a set; we write $x ≤ A$ if $x ≤ a$ for every $a ∈ A$. The size of a bucket $b$, i.e., the number of elements in $b$, is denoted by $s ( b )$. If buckets $b ′$ and $b ″$ merge into a new bucket $b$, written as $b ′ ∪ b ″ → b$, we clearly have $s ( b ′ ) + s ( b ″ ) = s ( b )$. Similarly, if a bucket $b$ splits into two buckets $b ′ , b ″$, written as $b → b ′ ∪ b ″$, then we have $s ( b ) = s ( b ′ ) + s ( b ″ )$ as well.

## 2. Some Ideas and Preliminary Suboptimal Solutions

A first variant with$O ( k log k )$amortized time per operation. Let n denote the current number of elements in the data structure, with the elements being stored in a linear list (or an array). By default (if n is large enough) the algorithm proceeds in phases.
If $n < 3 k$, and no phase is under way, proceed by brute force: For Insert, add the new element to the list; for Delete i, compute the elements in the ith quantile group and delete (return) one of them arbitrarily. Since k is constant, each operation takes time $O ( 3 k ) = O ( k )$.
If $n ≥ 3 k$, and no phase is under way, start a new phase: Reorganize the data structure by computing the $3 k$th quantiles of the set and the corresponding $3 k$ groups; store each group in a list (bucket) of size $n / ( 3 k )$. The next $n / ( 3 k )$ operations make up the current phase. Process each of these $n / ( 3 k )$ operations by using exclusively elements stored in these $3 k$ buckets. For Insert, add the new element to an initially empty overflow bucket (an empty overflow bucket is created at each reorganization). For Delete i, remove any element from the bucket $3 i − 1$, i.e., from the middle third of the ith quantile group (out of the total k).
The reorganization takes $O ( n log k )$ time and is executed about every $n / ( 3 k )$ steps, where each operation counts as one step. The resulting amortized cost per operation is
$O n log k n / k = O ( k log k ) .$
A second variant with$O ( k log k )$worst-case time per operation. The above idea is next refined so as to obtain the above expression as a worst-case time bound per operation. However, we need a larger set of quantiles: $9 k$ buckets will suffice (a more detailed analysis likely gives a better bound). We can assume that $n ≥ 9 k$. The algorithm proceeds in phases: Each phase starts with a reorganization, namely computing the $( 9 k )$th quantiles and the corresponding quantile groups in time $O ( n log ( 9 k ) ) = O ( n log k )$. For Insert, add the new element to an initially empty overflow bucket (an empty overflow bucket is created at each reorganization). For Delete i, remove any element from the bucket $9 i − 4$, i.e., from the middle fifth of the ith quantile group (out of the total k).
There are $n / ( 9 k )$ operations, i.e., $n / ( 9 k )$ steps following each reorganization until the results of the next reorganization become available. Assume that the data structure holds n items when the current reorganization starts (n is redefined at the start of each reorganization) and there are old buckets to use until the reorganization is finalized. That is, after that many steps, new buckets—however, with an old content—become available. These buckets are used for the next $n / ( 9 k )$ operations, and so on.
To transform the $O ( 1 )$ amortized time guarantee into a $O ( 1 )$ worst-case guarantee for each operation, spread the execution of reorganization over the next $n / ( 9 k )$ operations, i.e., over the entire phase. The resulting time per operation is bounded from above by
$O n log k n / ( 9 k ) = O k log k .$
Since Delete is serviced from the existent buckets and Insert is serviced using the overflow bucket, each operation involves inserting or deleting one element from a list; thus each operation takes $O ( k log k )$ time to process.
New buckets become available about every other $n / ( 9 k )$ operations; this is a rather imprecise estimate because the current number of elements, n, changes. Since a reorganization is spread out over multiple steps, the result becomes available with some delay, and moreover, its content is (partially) obsolete. Assume there are n elements at the start of a reorganization during phase $Φ$. At the end of the reorganization, the data structure reflects the earlier situation when there were n elements; and this organized structure is used to answer queries during the following phase $Φ ′$. As such, the number of elements, $n ′$, in the data structure at operation time (during $Φ ′$), belongs to the interval
$1 − 1 9 k 2 n , 1 + 1 9 k 2 n .$
The total number of operations in phases $Φ$ and $Φ ′$ is at most
$n 9 k + n + n / ( 9 k ) 9 k = 2 n 9 k + n 81 k 2 = 1 + 1 9 k 2 n − n .$
To verify that the data structure operates as intended, one needs to check that the rank of a deleted element belongs to the required interval (quantile group). The key observation is that any one operation can affect the rank of any element by at most 1: To be precise, only Insert or Delete of a smaller element can increase the rank of an element by 1 or decrease the rank of an element by 1, respectively.
By the above observation, the rank of a deleted element lies in the interval
$9 i − 5 9 k n − 1 + 1 9 k 2 n + n , 9 i − 4 9 k n + 1 + 1 9 k 2 n − n , where 1 ≤ i ≤ k .$
We need to show that this rank belongs to the interval
$i − 1 k n ′ , i k n ′ .$
It suffices to verify that
$9 i − 5 9 k n − 1 + 1 9 k 2 n + n ≥ i − 1 k 1 + 1 9 k 2 n ,$
and respectively that
$9 i − 4 9 k n + 1 + 1 9 k 2 n − n ≤ i k 1 − 1 9 k 2 n .$
Inequality (6) is equivalent to
$1 + 9 i − 5 9 k ≥ 1 + 1 9 k 2 1 + i − 1 k , or 1 + 4 9 ( k + i − 1 ) ≥ 1 + 2 9 k + 1 81 k 2 .$
Since $1 ≤ i ≤ k$, it is enough to verify that
$4 9 ( 2 k − 1 ) ≥ 2 9 k + 1 81 k 2 , or 2 2 k − 1 ≥ 1 9 k .$
Inequality (7) is equivalent to
$9 i − 4 9 k + 2 9 k + 1 81 k 2 ≤ i k 1 − 1 9 k 2 , or 1 9 k − 2 ≤ i 9 k 2 − 2 i k , or ( 1 − 18 k ) ≤ i k ( 1 − 18 k ) .$
Similarly, this follows from the inequality $1 ≤ i ≤ k$.
A third variant with$O ( log k )$amortized time per operation. We briefly describe an implementation achieving $O ( log k )$ amortized time per operation that is tailored on the idea of a B-tree; this variant was suggested by Fredman . Use a balanced binary search tree $A$ with $Θ ( log k )$ levels storing $O ( k )$ splitting keys at the leafs. Each leaf comprises a bucket of $Θ ( n / k )$ items, with order maintained between buckets, but not within buckets.
As mentioned earlier, a balanced binary search tree on distinct elements can be augmented with a size attribute for each node, thereby allowing the retrieval of an element of a given rank in time proportional to its height. Using this mechanism, $A$ can be augmented with such information allowing the retrieval of a leaf containing elements within a given quantile group, as needed for answering an operation request, in $O ( log k )$ time.
When an insertion causes a bucket to become too large, it gets split into two buckets by performing a median selection operation. The balanced binary search tree is correspondingly updated by deleting a leaf and inserting two new ones. Small buckets (due to deletions) get merged; the balanced binary search tree is correspondingly updated by deleting two leaves and inserting a new one. A bucket of size m, once split, won’t get split sooner than another $Ω ( m )$ operations.
When the number of elements doubles (or halves), a tree reorganization is triggered that partitions the present items into $6 k$ uniform sized buckets, so that the new common bucket size m is $n / ( 6 k )$ items. These event-triggered reorganizations ensure that buckets do not become too small unless they are target of deletions; similarly, buckets do not become too large unless they are target of insertions. Since the reorganization cost is $O ( n log k )$, and $Ω ( n )$ operation requests take place between successive reorganizations, this scheme yields $O ( log k )$ amortized time per operation.
Observe that when k is a constant, the 2nd variant supports operations in constant time.

## 3. A Variant with Optimal $O ( log k )$ Worst-Case Time per Operation

A brief examination of the approach in the 3rd variant reveals two bottlenecks in achieving $O ( log k )$ worst-case time per operation: The median computation that comes with splitting large buckets and the tree reorganization that occurs when n doubles (or halves). We briefly indicate below how ideas from the 2nd and 3rd early variants are refined to obtain $O ( log k )$ worst-case time per operation; in particular, $O ( 1 )$ time for constant k. It is shown in the process how execution in parallel of several sequential procedures can lead to a speed up of the data structure. This only means that some tasks are run as “background processes”, as no real parallel processing is used in this paper. The idea of slowing down for being faster has also appeared in other forms; see, e.g., .
A balanced BST for $Θ ( k )$ keys is used, subdividing the data into $O ( k )$ buckets. Each bucket is maintained as a linked list. A size attribute is associated with each node reflecting the number of elements stored in the subtree rooted at the respective node. Modifications in the data structure at each operation are reflected in appropriate updates of the size attributes at the $O ( log k )$ nodes of the $O ( 1 )$ search paths involved, in $O ( log k )$ time overhead per operation.
If n is the current number of elements, each bucket holds at most $n / ( 3 k )$ elements, and so each of the k quantile groups contains at least one of the buckets entirely. By choosing one such bucket at the end of the search path in the BST for executing a Delete operation from the ith quantile group guarantees its correctness.
The n elements are kept in $Θ ( k )$ buckets of maximum size $O ( n / k )$ that form the $Θ ( k )$ leaves of a balanced binary search tree $A$. As in the third variant (in Section 2), each leaf holds a bucket, with order maintained between buckets, but not within buckets. Buckets that become too large are split in order to enforce a suitable upper limit on the bucket size. Median finding procedures along with other preparatory and follow-up procedures accompanying bucket splits are scheduled as background computation, as in the second variant (in Section 2).
Our data structure merges small buckets in order to keep the number of buckets under control and renounces the periodic tree reorganizations by introducing new elements of design: a round robin process and a priority queue jointly control the maximum bucket size and the number of buckets in the BST. These mechanisms are introduced to prevent buckets becoming too small or too large as an effect of changes in the total number of elements, n, and not necessarily as an effect of operations directed to them.
Outline and features. Let $N = 12 k$. For illustrating the main ideas, assume now that $n ≥ N$. The buckets are linked in a doubly-linked linear list $B$, in key order; adding two links between the last and the first bucket yields a circular list $C$, referred to as the round robin list. We note that $B$ and $C$ are two views of the same data structure.
Each operation request translates to locating a suitable bucket for implementing the request. The circular list is traversed in a round robin fashion, so that the current round robin bucket in the list is also examined during the current operation request. The round robin process ensures that (i) the buckets do not exceed their maximum capacity, and (ii) certain “long-term” preparatory bucket-splitting procedures are run in the background over a succession of non-consecutive discrete time steps allocated to the same bucket.
Each bucket split entails a merge-test for the pair of adjacent buckets with the minimum sum of sizes. The process of merging adjacent buckets in $B$ is controlled by a priority queue in the form of a binary min-heap $H$. If $| B | = t$, i.e., there are t buckets, $H$ holds the $t − 1$ sums of sizes $s ( b ) + s ( b + )$, for buckets $b ∈ B$; here $b +$ denotes the bucket that follows $b$ in $B$. A merge is made provided the minimum value at the top of $H$ is below some threshold; and $A$, $B$ and $H$ are correspondingly updated. Merging adjacent buckets ensures that the total number of buckets remains under control, regardless of which buckets are accessed by operation requests.
The process of splitting buckets in $B$ is controlled by a round robin process. A bucket split is initiated as a background process provided its size (as a current bucket) is above some threshold. Splitting buckets ensures that buckets sizes remains under control, regardless of which buckets are accessed by operation requests. The bucket granularity is needed to ensure that the sloppy heap data structure responds correctly to operation requests.
Elements of the design. We highlight: (i) Use of the priority queue $H$ to keep the number of buckets under control; (ii) use of the round robin process to detect large buckets, and (iii) running the procedures involved at different rates as needed to ensure that certain task deadlines and precedence constraints among them are met. The data structure maintains the following two invariants:
$I 1$
Each bucket contains between 1 and $n / ( 3 k )$ elements; there is no limit from below imposed on the bucket size.
$I 2$
The number of buckets is between $3 k$ and $N = 12 k$, as implied by the maximum bucket size and a later argument based on the rules of operation (on merging adjacent buckets); see Action 2 and Lemma 1.
Recall that all $Θ ( k )$ buckets are linked in a circular round robin list: in key order, and with the last bucket linked to the first one. A pointer to the current round robin bucket (initialized arbitrarily, say, to the first bucket) is maintained. Each operation request advances this position in the list by one slot. Observe that every bucket becomes the round robin bucket about every $Θ ( k )$ discrete time steps. Further, each operation request leads via the search path in $A$ to one of the buckets, referred to as the operation bucket. Executing one operation is done by a sequence of actions performed in the operation bucket and the round robin bucket; these are referred to as the current buckets. All these actions are therefore associated with the same discrete time step. Every bucket update (this includes creation or deletion of buckets) entails a corresponding update of the binary heap $H$ in the (at most) two heap elements $s ( b ) + s ( b + )$ that depend on it.
A bucket is declared large if its current size exceeds $9 / 10$ of the maximum allowed, i.e., if the current size exceeds $9 n / ( 30 k )$. All other buckets are declared regular. Each operation may cause an update in the status of the round robin bucket and the operation bucket (among large and regular).
Action 1. Execute the requested operation: Either add a new element to the respective bucket, or delete an arbitrary element from it. If the operation bucket becomes empty as a result of the current Delete operation, it is deleted, and $B$, $H$ (and t) are correspondingly updated to reflect this change in $O ( log k )$ time. Status updates in the current two buckets are made, if needed. If a median finding procedure or a follow up procedure is under way in the current operation bucket or the current round robin bucket (see details below), the next segment consisting of 500 (or less) elementary operations of this background procedure is executed. These are instructions usually counted in standard analyses of algorithms, such as arithmetic operations, data movements, comparisons, etc. Specifically, we assume that the median of n elements can be found in at most $10 n$ elementary operations.
Action 2 (merge-test). Let $σ : = s ( b ) + s ( b + )$ be the minimum value at the top of the heap $H$. If $σ ≤ 5 n / ( 30 k )$, merge the two buckets into one: $b ∪ b + → b$, and update the tree $A$, the bucket list $B$ and the binary heap $H$ to reflect this change: (i) Delete the two buckets that are merged and insert the new one that results into $A$ and $B$; this only involves simple list handling and adjusting attributes at the $O ( log k )$ nodes of $A$ on the $O ( 1 )$ search paths involved. (ii) extract the minimum element from $H$ and insert the two new sum of sizes of two adjacent buckets formed by the new bucket into $H$ (if they exist).
Handling of $A , B$ and $H$ takes $O ( log k )$ time, $O ( 1 )$ time, and $O ( log k )$ time, respectively. In particular, this action ensures that the size of any new bucket obtained by merge is at most $5 n / ( 30 k )$. It is worth noting that: a bucket for which a partitioning procedure is under way, as described below, cannot be part of a pair of buckets to merge (i.e., passing the merge-test); bucket merges are not scheduled as background processes.
Action 3 (finalizing a split). Similar to the merge operations in Action 2, finalizing the split can be completed in $O ( log k )$ time: It essentially involves updating $A$, $B$, and $H$. It will be shown subsequently that the size of any new bucket resulting from a split is in the range $[ 4 n / ( 30 k ) , 6 n / ( 30 k ) ]$.
Besides Actions $1 − 3$, there are actions associated with procedures running in the background, whose execution is spread out over a succession of non-consecutive discrete time steps allocated to the same bucket. The procedures are in preparation of splitting large buckets.
Splitting a large bucket. For simplicity of exposition and without loss of generality, we may assume that $n ≥ c k$, for a suitable constant $c > 0$ (one can take $c = 130$). It is worth noting that a bucket may become large by repeated deletions from other buckets leading to a reduction in the total number of items, n; moreover, by the same reasoning, several buckets may become large at the same time.
Recall that a bucket $b$ is large if $s ( b ) ≥ 9 n / ( 30 k )$. When such condition is reached, no background procedure is active in that bucket; this condition launches a bucket split described below. Let $n 0 = n$ be the number of elements existent when the large bucket is detected and the procedure is initiated. Place $8.8 n 0 / ( 30 k )$ elements into (a main part) $P 1$ and the remaining $s ( b ) − | P 1 |$ elements into (a secondary part) $P 2$. It is worth noting at this point that even this first step of partitioning $b$ into $P 1$ and $P 2$ does not take $O ( 1 )$ time and is in fact part of the background procedure; indeed, each bucket is stored as a linked list and as such, partitioning it into two lists of prescribed sizes requires scanning the list; its size is $Θ ( n / k )$.
There are two possible cases: (i) $b$ becomes large as a result of insertion into $b$, and (ii) $b$ becomes large while being inactive and n is decreasing (as a result of deletions from other buckets). On one hand, $s ( b ) ≥ 9 n / ( 30 k )$, thus $0.2 n 0 / ( 30 k ) ≤ | P 2 |$; on the other hand, $s ( b ) ≤ 9 ( n + 12 k ) / ( 30 k ) ≤ 9 n / ( 30 k ) + 4$, and thus $| P 2 | ≤ 0.2 n 0 / ( 30 k ) + 4$, since at the latest, a large bucket will be detected and dealt with at the step when it becomes a round robin bucket, namely in at most $12 k$ steps by Lemma 1 (forthcoming at the end of this section). Consequently, in either case, we have $0.2 n 0 / ( 30 k ) ≤ | P 2 | ≤ 0.2 n 0 / ( 30 k ) + 4$ when the bucket splitting procedure is initiated. Any insertions and deletions from the current bucket until the split is finalized are performed using the secondary part $P 2$. A balanced partition of the current bucket (as explained below) will be obtained in at most $n 0 / 10$ time steps.
Consider the following $n 0 / 10$ operation requests. By Lemma 1 below, the number of buckets is at most $12 k$ at any time, and so at least $( n 0 / 10 ) / ( 12 k ) = n 0 / ( 120 k )$ time steps are allocated to $b$ in the round robin process by the $n 0 / 10$ time mark. Let $t 1$, where $n 0 / ( 120 k ) ≤ t 1 < n 0 / 10$, mark the first occurrence when a total of $n 0 / ( 120 k )$ discrete time steps have been allocated to $b$ (as operation steps or round robin steps). As shown next, this number of steps suffices for finalizing the balanced partition and the split of $b$. The process calls two procedures, labeled (A) and (B):
(A) Start a median finding procedure, i.e., for finding the two quantile groups $Q 1 , Q 2$ of $P 1$: An element $m ∈ Q 1 ∪ Q 2 = P 1$ is found so that $Q 1 ≤ m ≤ Q 2$ and $| | Q 1 | − | Q 2 | | ≤ 1$. At the point when this procedure is launched, the computational steps are scheduled so that every time the bucket gets accessed (either as the operation bucket or as the round robin bucket), 500 computational steps for selecting the median element of $P 1$ take place. Assume for concreteness that median finding on an input set S takes at most $10 | S |$ elementary operations; when applied to $P 1$, we have $| P 1 | ≤ 8.8 n 0 / ( 30 k )$, and thus $88 n 0 / ( 30 k )$ elementary operations suffice. At the rate of 500 per discrete time step, it follows that $88 n 0 / ( 15000 k ) ≤ n 0 / ( 160 k )$ time steps suffice for finding the median of $P 1$.
(B) After the median has been determined, a follow up procedure is initiated in the same bucket. It aims at reducing and finally eliminating the leftover of $P 2$, so that in another $n 0 / ( 480 k )$ discrete steps, a balanced partition of the current bucket is obtained. The follow up procedure starts with the two quantile groups of the same size, $4.4 n 0 / ( 30 k )$, as created by the median finding procedure, by comparing each element of $P 2$ against m and properly placing it in one of the two groups. This procedure runs at the rate of 10 items per discrete time step accessing the current bucket (either as the operation bucket or as the round robin bucket), until finally the partitioning process is completed with all elements in the current bucket properly placed against the pivot m. Note that $| P 2 | ≤ 0.2 n 0 / ( 30 k ) + 4 + n 0 / ( 480 k ) ≤ 0.5 n 0 / ( 30 k )$ at any time during the background procedure (as implied by the inequality $n ≥ 130 k$). At the rate of 10 items per discrete time step, it follows that $0.5 n 0 / ( 300 k ) ≤ n 0 / ( 480 k )$ time steps suffice for completing the follow up procedure.
The two procedures terminate within a total of at most $n 0 / ( 160 k ) + n 0 / ( 480 k ) = n 0 / ( 120 k )$ discrete time steps, as required. The parameters are chosen so that the split takes place before the large bucket $b$ becomes illegal.
At most $n 0 / 10$ operation requests have been made since the partitioning procedure was initiated and so $0.9 n 0 ≤ n ≤ 1.1 n 0$; thus, in terms of the current number of elements, n, the split of a large bucket $b$ (this qualification refers to the time when the partitioning procedure was initiated) produces two smaller buckets $b ′$, $b ″$, where
$4 n 30 k ≤ 4.4 n 0 30 k ≤ s ( b ′ ) , s ( b ″ ) ≤ 4.4 n 0 30 k + 0.4 n 0 30 k + n 0 480 k ≤ 5 n 0 30 k ≤ 6 n 30 k .$
Remark 1.
Let $b$ be a new bucket produced in the current operation. If $b$ is generated by a split operation, then  $4 n 30 k ≤ s ( b ) ≤ 6 n 30 k$ by (8). If $b$ is generated by a merge operation, then $s ( b ) ≤ 5 n 30 k$ by the merge-test.
Analysis of merging buckets and maintaining the two invariants. To prove that the two invariants $I 1$ and $I 2$ are maintained, we need the following key fact.
Lemma 1.
The number of buckets is at most $N = 12 k$ at any time.
Proof.
Let t denote the number of buckets after the current operation is executed, and $j = 1 , 2 , …$ denote the discrete time steps. Let $B 1 , … , B t$ be the buckets after the current step in key order. Write $a i = s ( B i )$, for $i = 1 , … , t$. We proceed by induction on j and show that, if the number of buckets in $A$ (and $B$) is at most N after each of the preceding N time steps, it remains at most N after the current time step. Observe that the number of buckets can only increase by one after a bucket split, and there can be at most two splits associated with a discrete time step. The induction basis is $j ≤ N / 2$, and then indeed, we have $t ≤ 2 j ≤ N$, as required.
For the induction step, assume that the number of buckets is at most N after the previous operation. If no bucket splits occur during the execution of the current operation, the number of buckets remains unchanged, and is thus still at most N after the current operation. If bucket splits occur, it suffices to show that the number of buckets is at most N after each split. Consider a split operation, and let $σ : = s ( b ) + s ( b + )$ be the minimum value at the top of the heap $H$ after the split. There are two cases:
Case 1.$σ ≤ 5 n / ( 30 k )$, and thus the merge is executed. Consequently, the number of buckets after the split is still at most N, as required.
Case 2.$σ > 5 n / ( 30 k )$, and thus no merge is executed. Since $H$ is a min-heap, we have
$a i + a i + 1 > 5 n 30 k , for i = 1 , … , t − 1 .$
Adding these $t − 1$ inequalities yields
$2 n = 2 ∑ i = 1 t a i > ( t − 1 ) 5 n 30 k ,$
or $t ≤ 12 k = N$, as claimed, and concluding the induction step. □
Summary of the analysis. As seen from the preceding paragraphs and the fact that the number of buckets is $t = O ( k )$, the total time per operation is $O ( log t ) + O ( log k ) + O ( 1 ) = O ( log k )$, as required.

## 4. Conclusions

#### 4.1. Technical Remarks

1. An argument due to Fredman  shows that executing a sequence of n operations (from among Insert and Delete i, where $1 ≤ i ≤ k$) requires $Ω ( n log k )$ time in the worst case, regardless of the implementation of the data structure. The argument relies on the information theory lower bound (, Ch. 5.3.1). (For completeness, it is included in the Appendix A.)
2. In addition to the two operations provided Insert and Delete i, the following operation can be also accommodated at no increase in cost: Read i: this returns some element x which belongs to the ith quantile group of the current set, where $1 ≤ i ≤ k$; the element remains part of the data structure.
3. An alternative solution (to that outlined in Section 3) achieving $O ( log k )$ worst-case time per operation was conceived by Fredman  (after the author of the current paper had communicated him the main result). (i) His solution avoids the need to merge small buckets (in order to keep the number of buckets under control) by maintaining two running copies of the data structure and performing periodic tree reorganizations that create uniform-sized buckets. Buckets that become large are split using a mechanism similar to that devised here in Section 3. Without going into the details, we point out that the decision to avoid merging small buckets comes at a high price. The main reasons are the need to maintain multiple running copies of the data structure (with two copies under permanent construction, etc), handling subtle consistency issues generally hard to satisfy, and the likely reduced speed caused by the above items. (ii) Another cumbersome approach claimed to be a simplification can be found in his subsequent arXiv posting . As such, neither alternative solution—(i) or (ii) above—matches in simplicity the one given here.
4. As mentioned earlier, the $O ( log 1 / ε )$ amortized complexity of the soft heap is optimal. However, this does not hold for the worst-case complexity in regard to its Insert, Delete and Findmin operations. In contrast, the $O ( log 1 / ε )$ worst-case complexity per operation of the selectable sloppy heap is optimal (where $ε ∼ 1 / k$).
5. Although the 2nd variant in Section 2 has a suboptimal dependence in k, this variant may provide an attractive solution for implementation, particularly for small values of k.

#### 4.2. Applications and Concluding Remarks

1. The new data structure finds applications in settings with large dynamic sets where insertions and deletions need to be handled fast, and there is no need to be very precise with the ranks of the elements handled. One such application is approximate sorting. An array of n elements is said to be L-sorted if for every $i ∈ [ n ]$, we have $| rank ( a i ) − i | ≤ L$; see also [39,40]. As shown by the lower bound argument in the Appendix A, the selectable sloppy heap can be used to L-sort n elements in $O ( n log ( n / L ) )$ time.
2. As mentioned in the introduction, the selection problem, and computing the median in particular, are in close relation with the problem of finding the quantiles of a set. A typical use of the median relies on its property of being both larger or equal and smaller or equal than a constant fraction of the n elements. Following Yao , an element (think of a player, in the context of tournaments) is said to be $( i , j )$-mediocre if it is neither among the top i nor among the bottom j of a totally ordered set S. As such, an element from the middle third quantile group of an n-element set is $( ⌊ n / 3 ⌋ , ⌊ n / 3 ⌋ )$-mediocre; or simply mediocre, for short. Repeatedly returning a mediocre element in a dynamic setting (with an initially empty set) can thus be accomplished via the new data structure, by setting $k = 3$ and then repeatedly executing Delete 2 or Read 2, as needed, at a minimal (constant) query cost. Similarly, putting $k = 100$ sets up the data structure for dynamic percentile maintenance in $O ( 1 )$ time per operation; to the best of our knowledge, this outperforms previously available data structures with respect to this application; e.g., the soft heap data structure of Chazelle  only offers constant amortized time per operation.
3. This is a continuation of our earlier discussion in Section 1 on using BSTs in the context of dynamic selection taking into account the new data structure. Traditionally, search trees do not allow duplicate keys; it is however an easy matter to augment each node of such a tree with a multiplicity attribute associated with each distinct key. In particular, the multiplicity attribute is taken into account when computing the size attribute of a node. Now having a balanced search tree on n items augmented as described, insertion, deletion, and search all take $O ( log n )$ time.
Our construction method can be used for any parameter k, with $2 ≤ k ≤ n$. The data structure obtained in this way can be viewed as an approximate search tree. In particular, one can search for a given key and the approximate rank of a search key can be determined. To be precise, the following hold: (1) For every k, with $2 ≤ k ≤ n$, an approximate search tree on n items (duplicate keys allowed) can be constructed in $O ( n log k )$ time. (2) Search for a given key takes $O ( n / k + log k )$ time per operation; its approximate rank, i.e., the quantile group to which it belongs (out of k), can be reported in $O ( log k )$ time (regardless of the presence of the key!). (3) Insertion can be accommodated in $O ( log k )$ time per operation. (4) Deletion of an unspecified key from a given quantile group (out of k) takes $O ( log k )$ time; while deletion of a given key takes $O ( n / k + log k )$ time.
It is worth noting that the approximate search tree we just described appears competitive when k is small and the search function is infrequently used. Then insertion and deletion of an unspecified key from a given quantile group (out of k) takes $O ( log k )$ time (the deleted element is revealed after the operation); e.g., if $k = O ( log n )$, these operations take $O ( log log n )$ time. On the other hand, the approximate search tree above is no real competitor for the exact solution previously discussed; indeed, no choice of k in our data structure would allow an improvement in the performance of all three basic operations.
4. Interestingly enough, most applications envisioned by Chazelle  for the soft heap (i.e., four items from his list of five) can be dealt with using the selectable sloppy heap; these include dynamic maintenance of percentiles, linear-time selection, and two versions of approximate sorting. One can observe that the complexity analysis for the soft heap, of the error rate in particular, is more complicated than that for the selectable sloppy heap; moreover, special effort is required to ensure that the space needed by the soft heap is linear in the number of items present. In at least one application, approximate sorting, the analysis of doing that with a soft heap is more involved than that for using our structure for this task. Needless to say, the soft heap only allows deletion of small items. As such, the new data structure presented here compares favorably to the soft heap with respect to insertion and deletion. Moreover, the constant amortized guarantee per operation is replaced by the stronger constant worst-case guarantee per operation in our case.
It is worth recalling that the soft heap was designed with a specific application in mind, minimum spanning trees. Given a connected graph $G = ( V , E )$, where $| V | = n$, $| E | = m$, with weighted edges, Chazelle  showed that a minimum spanning tree (MST) can be computed by a deterministic algorithm in $O ( m α ( m , n ) )$ time, where $α$ is the (slowly growing) inverse of the Ackermann function. A randomized linear-time algorithm was given by Karger et al. . The question of whether the selectable sloppy heap can be used for MST computation is left open.
5. The method described here is likely to have further impact in the field of data structure design in extending asymptotic amortized upper bounds to same formula asymptotic worst-case bounds (i.e., by a constant factor adjustment); possible candidates are for instance those that involve periodic restructuring of the data structure.

## Funding

This research received no external funding.

## Conflicts of Interest

The authors declare no conflicts of interest.

## Appendix A

In this section it is shown that executing a sequence of n operations (from among Insert and Delete i, where $1 ≤ i ≤ k$) may require $Ω ( n log k )$ time in the worst case, regardless of the implementation of the data structure.
Lower bound. Suppose the delete operation always removes one of the L smallest items. Then to sort n items: (a) Insert them, (b) do repeated deletion, and (c) sort the sequence of deleted items in the order created by the successive deletions by executing only $n ⌈ log L ⌉$ comparisons.
To accomplish (a) and (b) using the data structure, call Insert n times followed by Delete 1 n times (as we will set $L = ⌈ n / k ⌉$). To accomplish (c), start from the right end (the last of the deleted items), and sort from right-to-left by successive insertions into a sorted list being formed, inserting each successive item from the left end. A given item to be inserted would end up in a position no further than L from the front of the sorted list under formation, since when it was deleted, it was one of the L smallest items. Therefore its correct position can be obtained by a $⌈ log L ⌉$-comparison binary search (as in binary insertion sort (, Ch. 5.2.1).
Since by the information theory lower bound (, Ch. 5.3.1), (a)-(c) accomplish a task requiring $⌈ log n ! ⌉ = n log n − O ( n )$ comparisons in the worst case, and (c) requires only $n ⌈ log L ⌉ = n log L + O ( n )$ comparisons, it must be that (a) and (b) jointly require $n log ( n / L ) − O ( n )$ comparisons in the worst case. Setting $L = ⌈ n / k ⌉$ yields that (a) and (b) jointly require $n log k − O ( n ) = Ω ( n log k )$ comparisons.
Finally, substitute n for $2 n$. It follows that there exists a sequence of n operations that require $Ω ( n log k )$ time, thus $Ω ( log k )$ amortized time per operation.

## References

1. Blum, M.; Floyd, R.W.; Pratt, V.; Rivest, R.L.; Tarjan, R.E. Time bounds for selection. J. Comput. Syst. Sci. 1973, 7, 448–461. [Google Scholar] [CrossRef][Green Version]
2. Floyd, R.W.; Rivest, R.L. Expected time bounds for selection. Commun. ACM 1975, 18, 165–172. [Google Scholar] [CrossRef]
3. Hyafil, L. Bounds for selection. SIAM J. Comput. 1976, 5, 109–114. [Google Scholar] [CrossRef]
4. Schönhage, A.; Paterson, M.; Pippenger, N. Finding the median. J. Comput. Syst. Sci. 1976, 13, 184–199. [Google Scholar] [CrossRef][Green Version]
5. Yap, C.K. New upper bounds for selection. Commun. ACM 1976, 19, 501–508. [Google Scholar] [CrossRef]
6. Cormen, T.H.; Leiserson, C.E.; Rivest, R.L.; Stein, C. Introduction to Algorithms, 3rd ed.; MIT Press: Cambridge, MA, USA, 2009. [Google Scholar]
7. Kleinberg, J.; Tardos, É. Algorithm Design; Pearson & Addison–Wesley: Boston, MA, USA, 2006. [Google Scholar]
8. Mitzenmacher, M.; Upfal, E. Probability and Computing: Randomized Algorithms and Probabilistic Analysis; Cambridge University Press: Cambridge, UK, 2005. [Google Scholar]
9. Chen, K.; Dumitrescu, A. Select with groups of 3 or 4. In Proceedings of the 14th International Symposium on Algorithms and Data Structures (WADS 2015), Victoria, BC, Canada, 5–7 August 2015; Volume 9214, pp. 189–199. [Google Scholar]
10. Ajtai, M.; Komlós, J.; Steiger, W.L.; Szemerédi, E. Optimal parallel selection has complexity O(log logn). J. Comput. Syst. Sci. 1989, 38, 125–133. [Google Scholar] [CrossRef]
11. Battiato, S.; Cantone, D.; Catalano, D.; Cincotti, G.; Hofri, M. An efficient algorithm for the approximate median selection problem. In Proceedings of the 4th Italian Conference on Algorithms and Complexity (CIAC 2000), Rome, Italy, 1–3 March 2000; Volume 1767 of LNCS, pp. 226–238. [Google Scholar]
12. Bent, S.W.; John, J.W. Finding the median requires 2n comparisons. In Proceedings of the 17th Annual ACM Symposium on Theory of Computing (STOC 1985), Providence, RI, USA, 6–8 May 1985; pp. 213–216. [Google Scholar]
13. Cunto, W.; Munro, J.I. Average case selection. J. ACM 1989, 36, 270–279. [Google Scholar] [CrossRef]
14. Dor, D.; Håstad, J.; Ulfberg, S.; Zwick, U. On lower bounds for selecting the median. SIAM J. Discret. Math. 2001, 14, 299–311. [Google Scholar] [CrossRef]
15. Dor, D.; Zwick, U. Finding the αnth largest element. Combinatorica 1996, 16, 41–58. [Google Scholar] [CrossRef]
16. Dor, D.; Zwick, U. Selecting the median. SIAM J. Comput. 1999, 28, 1722–1758. [Google Scholar] [CrossRef]
17. Fussenegger, F.; Gabow, H.N. A counting approach to lower bounds for selection problems. J. ACM 1979, 26, 227–238. [Google Scholar] [CrossRef]
18. Gasarch, W.; Kelly, W.; Pugh, W. Finding the ith largest of n for small i,n. SIGACT News 1996, 27, 88–96. [Google Scholar] [CrossRef]
19. Hadian, A.; Sobel, M. Selecting the t-th largest using binary errorless comparisons. Comb. Theory Its Appl. 1969, 4, 585–599. [Google Scholar]
20. Hoare, C.A.R. Algorithm 63 (PARTITION) and algorithm 65 (FIND). Commun. ACM 1961, 4, 321–322. [Google Scholar] [CrossRef]
21. John, J.W. A new lower bound for the set-partitioning problem. SIAM J. Comput. 1988, 17, 640–647. [Google Scholar] [CrossRef]
22. Kirkpatrick, D.G. A unified lower bound for selection and set partitioning problems. J. ACM 1981, 28, 150–165. [Google Scholar] [CrossRef]
23. Paterson, M. Progress in selection. In Proceedings of the 5th Scandinavian Workshop on Algorithm Theory (SWAT 1996), Reykjavík, Iceland, 3–5 July 1996; Volume 1097, pp. 368–379. [Google Scholar]
24. Yao, A.; Yao, F. On the average-case complexity of selecting the kth best. SIAM J. Comput. 1982, 11, 428–447. [Google Scholar] [CrossRef]
25. Yao, F. On Lower Bounds for Selection Problems, Technical Report MAC TR-121; Massachusetts Institute of Technology: Cambridge, MA, USA, 1974. [Google Scholar]
26. Knuth, D.E. The Art of Computer Programming, Vol. 3: Sorting and Searching, 2nd ed.; Addison–Wesley: Reading, MA, USA, 1998. [Google Scholar]
27. Hofri, M. Optimal selection and sorting via dynamic programming. ACM J. Exp. Algorithmics 2013, 18, 2–3. [Google Scholar] [CrossRef]
28. Baase, S. Computer Algorithms: Introduction to Design and Analysis, 2nd ed.; Addison-Wesley: Reading, MA, USA, 1988. [Google Scholar]
29. Dasgupta, S.; Papadimitriou, C.; Vazirani, U. Algorithms; Mc Graw Hill: New York, NY, USA, 2008. [Google Scholar]
30. Aho, A.V.; Hopcroft, J.E.; Ullman, J.D. Data Structures and Algorithms; Addison–Wesley: Reading, MA, USA, 1983. [Google Scholar]
31. Jayapaul, V.; Munro, J.I.; Raman, V.; Satti, S.R. Sorting and selection with equality comparisons. In Proceedings of the 14th International Symposium on Algorithms and Data Structures, Victoria, BC, Canada, 5–7 August 2015; Volume 9214, pp. 434–445. [Google Scholar]
32. Kirkpatrick, D.G. Closing a long-standing complexity gap for selection: V3(42) = 50. In Space-Efficient Data Structures, Streams, and Algorithms—Papers in Honor of J. Ian Munro on the Occasion of His 66th Birthday; Brodnik, A., López-Ortiz, A., Raman, V., Viola, A., Eds.; Springer: Berlin/Heidelberg, Germany, 2013; Volume 8066, pp. 61–76. [Google Scholar]
33. Alexandrescu, A. Fast deterministic selection. In Proceedings of the 16th International Symposium on Experimental Algorithms (SEA 2017), London, UK, 21–23 June 2017; pp. 24:1–24:19. [Google Scholar]
34. Chan, T.M. Quake heaps: A simple alternative to Fibonacci heaps. In Space-Efficient Data Structures, Streams, and Algorithms—Papers in Honor of J. Ian Munro on the Occasion of His 66th Birthday; Brodnik, A., López-Ortiz, A., Raman, V., Viola, A., Eds.; Springer: Berlin/Heidelberg, Germany, 2013; Volume 8066, pp. 27–32. [Google Scholar]
35. Chazelle, B. The soft heap: An approximate priority queue with optimal error rate. J. ACM 2000, 47, 1012–1027. [Google Scholar] [CrossRef]
36. Fredman, M.; Rutgers University, New Brunswick, NJ, USA. Personal communication, 2016.
37. Cole, R. Slowing down sorting networks to obtain faster sorting algorithms. J. ACM 1987, 34, 200–208. [Google Scholar] [CrossRef]
38. Fredman, M. Comments on Dumitrescu’s “A Selectable Sloppy Heap”. arXiv, 2016; arXiv:1610.02953. [Google Scholar]
39. Estivill-Castro, V.; Wood, D. Sorting, measures of disorder, and worst-case performance. In New Results and New Trends in Computer Science; Maurer, H., Ed.; Springer: Berlin/Heidelberg, Germany, 1991; Volume 555, pp. 124–131. [Google Scholar]
40. Manilla, H. Measures of presortedness and optimal sorting algorithms. IEEE Trans. Comput. 1985, 34, 318–325. [Google Scholar] [CrossRef]
41. Chazelle, B. A minimum spanning tree algorithm with inverse-Ackermann type complexity. J. ACM 2000, 47, 1028–1047. [Google Scholar] [CrossRef][Green Version]
42. Karger, D.R.; Klein, P.N.; Tarjan, R.E. A Randomized linear-time algorithm to find minimum spanning trees. J. ACM 1995, 42, 321–328. [Google Scholar] [CrossRef]