KO | EN

GitLite

Minimalist Open Source Repository Search Engine

gitlite — search

#dsh #dsh-plugin #developer-tools #ai-agent #claude-code #codex #typescript #ai-agents #deepseek-harness #mcp #cli #rust

about

★ 3 Open GitHub ↗

:fallen_leaf: Heap data structures for JavaScript

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

:fallen_leaf: [Heaps](https://make-github-pseudonymous-again.github.io/js-heap)
[![License](https://img.shields.io/github/license/make-github-pseudonymous-again/js-heap.svg?style=flat)](https://raw.githubusercontent.com/make-github-pseudonymous-again/js-heap/main/LICENSE)
[![GitHub issues](https://img.shields.io/github/issues/make-github-pseudonymous-again/js-heap.svg?style=flat)](https://github.com/make-github-pseudonymous-again/js-heap/issues)
==

Heap data structures and algorithms in JavaScript.
Parents are
[js-data-structures](https://github.com/make-github-pseudonymous-again/js-data-structures)
and
[js-algorithms](https://github.com/make-github-pseudonymous-again/js-algorithms).

## :baby: Children

This README regroups projects implementing heap data
structures and algorithms in JavaScript.
This repository does not contain any code.

### :herb: Data Structures

#### Classical

- [x] [@heap-data-structure/d-ary-heap](https://github.com/heap-data-structure/d-ary-heap): d-ary heap data structure for JavaScript
  - [x] [@heap-data-structure/binomial-heap](https://github.com/heap-data-structure/binomial-heap): Binomial heap data structure for JavaScript
  - [x] [@heap-data-structure/pairing-heap](https://github.com/heap-data-structure/pairing-heap): Pairing heap data structure for JavaScript
  - [x] [@heap-data-structure/fibonacci-heap](https://github.com/heap-data-structure/fibonacci-heap): Fibonacci heap data structure for JavaScript

#### Variants

- [ ] [Leftist tree](https://en.wikipedia.org/wiki/Leftist_tree)
  - [ ] [Skew heap](https://en.wikipedia.org/wiki/Skew_heap)
  - [ ] [Weak heap](https://en.wikipedia.org/wiki/Weak_heap)
  - [ ] [Rank-pairing heap](http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.153.4644&rep=rep1&type=pdf)

#### Advanced

- [ ] [Leonardo heap](https://www.keithschwarz.com/smoothsort)
  - [ ] [Brodal queue](https://en.wikipedia.org/wiki/Brodal_queue)
  - [ ] [Strict Fibonacci heap](https://en.wikipedia.org/wiki/Fibonacci_heap)
  - [ ] [2-3 heap](https://en.wikipedia.org/wiki/2-3_heap)

### :signal_strength: Sorting Algorithms

- [x] [@comparison-sorting/heap-sort](https://github.com/comparison-sorting/heap-sort): Heap sort algorithm for Javascript

### :microscope: Testing

- [x] [@heap-data-structure/specification](https://github.com/heap-data-structure/specification): Specification for heap data structures in JavaScript

### :unicorn: Other

- [x] [@data-structure/heapq](https://github.com/data-structures-and-algorithms/heapq): Python's heapq library for Javascript

## :scroll: Reference

- http://www.cs.princeton.edu/~wayne/cs423/lectures/heaps-4up.pdf
  - http://stackoverflow.com/questions/6531543/efficient-implementation-of-binary-heaps
  - https://en.wikipedia.org/wiki/Introduction_to_Algorithms

about

Explore Similar Repositories

Was this content helpful?

Recent Feedback

Download README