npmpackage.info

Gathering detailed insights and metrics for quickselect

Other packages similar to quickselect

median-quickselect

1.0.1

Fast implementation of median search using quickselect algorithm

ml-array-median

1.1.6

Get the median value in an array

qselect

1.1.0

Implementation of the QuickSelect algorithm in JavaScript for top-k computations

gleo

0.10.0

WebGL-powered geographical maps.

Gathering detailed insights and metrics for quickselect

quickselect

A fast selection algorithm in JavaScript.

3.0.0

ISC

JavaScript

342,349,655 3.6

Installations

npm install quickselect

Pull Requests

Open

0

Total

7

Closed

3

Merged

4

Issues

Open

3

Total

7

Closed

4

Releases

v3.0.0

Published on 03 Jul 2024

v2.0.0

Published on 04 Apr 2018

v1.1.1

Published on 04 Apr 2018

v1.1.0

Published on 03 Apr 2018

v1.0.1

Published on 21 Dec 2017

v1.0.0

Published on 17 Feb 2016

View all 6 releases

Developer

mourner

Developer Guide

BETA

Module System

ESM

Min. Node Version

Typescript Support

Yes

Node Version

20.14.0

NPM Version

10.8.0 Statistics

86 Stars

24 Commits

17 Forks

4 Watching

1 Branches

4 Contributors

Updated on 01 Nov 2024

Languages

JavaScript (100%)

Total Downloads

Cumulative downloads

Total Downloads

342,349,655

Last day

9.3%

696,906

Compared to previous day

Last week

5.7%

3,470,273

Compared to previous week

Last month

10.1%

13,820,219

Compared to previous month

Last year

35.9%

115,341,711

Compared to previous year

Daily Downloads

Weekly Downloads

Monthly Downloads

Yearly Downloads

Dev Dependencies

eslint eslint-config-mourner esm rollup tape typescript

Versions

quickselect

A tiny and fast selection algorithm in JavaScript (specifically, Floyd-Rivest selection).

1quickselect(array, k[, left, right, compareFn]);

Rearranges items so that all items in the [left, k] are the smallest. The k-th element will have the (k - left + 1)-th smallest value in [left, right].

array: the array to partially sort (in place)
k: middle index for partial sorting (as defined above)
left: left index of the range to sort (0 by default)
right: right index (last index of the array by default)
compareFn: compare function

Example:

1const arr = [65, 28, 59, 33, 21, 56, 22, 95, 50, 12, 90, 53, 28, 77, 39];
2
3quickselect(arr, 8);
4
5// arr is [39, 28, 28, 33, 21, 12, 22, 50, 53, 56, 59, 65, 90, 77, 95]
6//                                         ^^ middle index

No vulnerabilities found.

10

Binary-Artifacts

Determines if the project has generated executable (binary) artifacts in the source repository.

10

Dangerous-Workflow

Determines if the project's GitHub Action workflows avoid dangerous patterns.

10

License

Determines if the project has defined a license.

9

Vulnerabilities

Determines if the project has open, known unfixed vulnerabilities.

3

Pinned-Dependencies

Determines if the project has declared and pinned the dependencies of its build process.

1

Code-Review

Determines if the project requires human code review before pull requests (aka merge requests) are merged.

0

Maintained

Determines if the project is "actively maintained".

0

Token-Permissions

Determines if the project's workflows follow the principle of least privilege.

0

CII-Best-Practices

Determines if the project has an OpenSSF (formerly CII) Best Practices Badge.

0

Fuzzing

Determines if the project uses fuzzing.

0

Security-Policy

Determines if the project has published a security policy.

0

Branch-Protection

Determines if the default and release branches are protected with GitHub's branch protection settings.

0

SAST

Determines if the project uses static code analysis.

Score

3.6

/10

Last Scanned on 2024-11-18

The Open Source Security Foundation is a cross-industry collaboration to improve the security of open source software (OSS). The Scorecard provides security health metrics for open source projects.

Learn More