arXiv Open Access 2013

A Functional Approach to Standard Binary Heaps

Vladimir Kostyukov

Lihat Sumber

Abstrak

This paper describes a new and purely functional implementation technique of binary heaps. A binary heap is a tree-based data structure that implements priority queue operations (insert, remove, minimum/maximum) and guarantees at worst logarithmic running time for them. Approaches and ideas described in this paper present a simple and asymptotically optimal implementation of immutable binary heap.

Topik & Kata Kunci

cs.DS

Penulis (1)

Vladimir Kostyukov

Format Sitasi

APA MLA BibTeX

Kostyukov, V. (2013). A Functional Approach to Standard Binary Heaps. https://arxiv.org/abs/1312.4666

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2013
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓