arXiv
Open Access
2023
Median of heaps: linear-time selection by recursively constructing binary heaps
Oliver Serang
Abstrak
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.
Topik & Kata Kunci
Penulis (1)
O
Oliver Serang
Akses Cepat
Informasi Jurnal
- Tahun Terbit
- 2023
- Bahasa
- en
- Sumber Database
- arXiv
- Akses
- Open Access ✓