Fragile Complexity of Adaptive Algorithms

01/30/2021
by   Prosenjit Bose, et al.
0

The fragile complexity of a comparison-based algorithm is f(n) if each input element participates in O(f(n)) comparisons. In this paper, we explore the fragile complexity of algorithms adaptive to various restrictions on the input, i.e., algorithms with a fragile complexity parameterized by a quantity other than the input size n. We show that searching for the predecessor in a sorted array has fragile complexity Θ(log k), where k is the rank of the query element, both in a randomized and a deterministic setting. For predecessor searches, we also show how to optimally reduce the amortized fragile complexity of the elements in the array. We also prove the following results: Selecting the k-th smallest element has expected fragile complexity O(loglog k) for the element selected. Deterministically finding the minimum element has fragile complexity Θ(log(Inv)) and Θ(log(Runs)), where Inv is the number of inversions in a sequence and Runs is the number of increasing runs in a sequence. Deterministically finding the median has fragile complexity O(log(Runs) + loglog n) and Θ(log(Inv)). Deterministic sorting has fragile complexity Θ(log(Inv)) but it has fragile complexity Θ(log n) regardless of the number of runs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/01/2020

Searching, Sorting, and Cake Cutting in Rounds

We study sorting and searching in rounds motivated by a cake cutting pro...
research
05/03/2022

Approximate Selection with Unreliable Comparisons in Optimal Expected Time

Given n elements, an integer k and a parameter ε, we study to select an ...
research
04/12/2020

Multiparty Selection

Given a sequence A of n numbers and an integer (target) parameter 1≤ i≤ ...
research
12/07/2020

Galloping in natural merge sorts

We study the algorithm TimSort and the sub-routine it uses to merge mono...
research
12/13/2018

Optimal Algorithm for Profiling Dynamic Arrays with Finite Values

How can one quickly answer the most and top popular objects at any time,...
research
09/05/2020

A Class of Optimal Structures for Node Computations in Message Passing Algorithms

Consider the computations at a node in the message passing algorithms. A...
research
01/19/2020

Chaining with overlaps revisited

Chaining algorithms aim to form a semi-global alignment of two sequences...

Please sign up or login with your details

Forgot password? Click here to reset