npm package discovery and stats viewer.

Discover Tips

  • General search

    [free text search, go nuts!]

  • Package details

    pkg:[package-name]

  • User packages

    @[username]

Sponsor

Optimize Toolset

I’ve always been into building performant and accessible sites, but lately I’ve been taking it extremely seriously. So much so that I’ve been building a tool to help me optimize and monitor the sites that I build to make sure that I’m making an attempt to offer the best experience to those who visit them. If you’re into performant, accessible and SEO friendly sites, you might like it too! You can check it out at Optimize Toolset.

About

Hi, 👋, I’m Ryan Hefner  and I built this site for me, and you! The goal of this site was to provide an easy way for me to check the stats on my npm packages, both for prioritizing issues and updates, and to give me a little kick in the pants to keep up on stuff.

As I was building it, I realized that I was actually using the tool to build the tool, and figured I might as well put this out there and hopefully others will find it to be a fast and useful way to search and browse npm packages as I have.

If you’re interested in other things I’m working on, follow me on Twitter or check out the open source projects I’ve been publishing on GitHub.

I am also working on a Twitter bot for this site to tweet the most popular, newest, random packages from npm. Please follow that account now and it will start sending out packages soon–ish.

Open Software & Tools

This site wouldn’t be possible without the immense generosity and tireless efforts from the people who make contributions to the world and share their work via open source initiatives. Thank you 🙏

© 2024 – Pkg Stats / Ryan Hefner

@kartjim/heap

v1.1.1

Published

MinHeap, MaxHeap and heapSort implementation in JavaScript

Downloads

8

Readme

heap

在大部分编程语言中,都已经有内置方法实现它,但似乎JS并没有。

最大堆和最小堆:用于高效快速地取得当前数据集中最大或者最小的元素

The default initial size of heap is 0.

install

npm i @kartjim/heap

require

const {
    MaxHeap,
    MinHeap,
    minHeapSort,
    maxHeapSort
} = require('@kartjim/heap');

import

import {
    MaxHeap,
    MinHeap,
    minHeapSort,
    maxHeapSort
} from '@kartjim/heap';

HeapSort

maxHeapSort

sort the array using MaxHeap (from maximum to minimum).

const arr = [12, 668, 1, 0, 4, 67];
maxHeapSort(arr) // [668, 67, 12, 4, 1, 0]

minHeapSort

sort the array using MaxHeap (from minimum to maximum).

const arr = [12, 668, 1, 0, 4, 67];
minHeapSort(arr) // [0, 1, 4, 12, 67, 668]

MaxHeap API

use

constructor

时间复杂度: $O(N)$
空间复杂度: $O(N)$

const heap = new MaxHeap(4);

push

add a new element to the MaxHeap.

时间复杂度: $O(log N)$
空间复杂度: $O(1)$

heap.push(1);
heap.push(2);
heap.push(3);

peek

return the max element in the MaxHeap.

时间复杂度: $O(1)$。
空间复杂度: $O(1)$。

heap.peek() // 3

pop

remove the max element in the MaxHeap.

时间复杂度: $O(log N)$
空间复杂度: $O(1)$

heap.pop() // 3

getSize

return the size of the MaxHeap.

heap.getSize() // 2

isEmpty

check if the MaxHeap is empty

heap.isEmpty() // false

MaxHeap.heapify

create a MaxHeap from a Array.

const t = MaxHeap.heapify([1, 2, 3, 4]);
t.peek() // 4

MinHeap API

use

constructor

时间复杂度: $O(N)$
空间复杂度: $O(N)$

const heap = new MinHeap(4);

push

add a new element to the MinHeap.

时间复杂度: $O(log N)$
空间复杂度: $O(1)$

heap.push(1);
heap.push(2);
heap.push(3);

peek

return the max element in the MinHeap.

时间复杂度: $O(1)$。
空间复杂度: $O(1)$。

heap.peek() // 1

pop

remove the max element in the MinHeap.

时间复杂度: $O(log N)$
空间复杂度: $O(1)$

heap.pop() // 1

getSize

return the size of the MinHeap.

heap.getSize() // 2

isEmpty

check if the MinHeap is empty

heap.isEmpty() // false

MaxHeap.heapify

create a MinHeap from a Array.

const t = MaxHeap.heapify([1, 2, 3, 4]);
t.peek() // 1