Median of heaps: linear-time selection by recursively constructing binary heaps

04/24/2023
by   Oliver Serang, et al.
0

The first worst-case linear-time algorithm for selection was discovered in 1973; however, linear-time binary heap construction was first published in 1964. Here we describe another worst-case linear selection algorithm,which is simply implemented and uses binary heap construction as its principal engine. The algorithm is implemented in place, and shown to perform similarly to in-place median of medians.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/12/2018

Linear-Time In-Place DFS and BFS in the Restore Model

We present an in-place depth first search (DFS) and an in-place breadth ...
research
11/02/2018

Worst-Case Efficient Sorting with QuickMergesort

The two most prominent solutions for the sorting problem are Quicksort a...
research
05/25/2021

Diameter, radius and all eccentricities in linear time for constant-dimension median graphs

Median graphs form the class of graphs which is the most studied in metr...
research
06/03/2019

Direct Linear Time Construction of Parameterized Suffix and LCP Arrays for Constant Alphabets

We present the first worst-case linear time algorithm that directly comp...
research
11/15/2022

Resilient Set-based State Estimation for Linear Time-Invariant Systems Using Zonotopes

This paper considers the problem of set-based state estimation for linea...
research
11/30/2019

Exact Polynomial Time Algorithm for the Response Time Analysis of Harmonic Tasks with Constrained Release Jitter

In some important application areas of hard real-time systems, preemptiv...
research
11/14/2018

Computing the Minkowski Sum of Convex Polytopes in ^d

We propose a method to efficiently compute the Minkowski sum, denoted by...

Please sign up or login with your details

Forgot password? Click here to reset