quickselect

WebJar for quickselect

License

License

ISC
GroupId

GroupId

org.webjars.npm
ArtifactId

ArtifactId

quickselect
Last Version

Last Version

2.0.0
Release Date

Release Date

Type

Type

jar
Description

Description

quickselect
WebJar for quickselect
Project URL

Project URL

https://www.webjars.org
Source Code Management

Source Code Management

https://github.com/mourner/quickselect.git

Download quickselect

How to add to project

<!-- https://jarcasting.com/artifacts/org.webjars.npm/quickselect/ -->
<dependency>
    <groupId>org.webjars.npm</groupId>
    <artifactId>quickselect</artifactId>
    <version>2.0.0</version>
</dependency>
// https://jarcasting.com/artifacts/org.webjars.npm/quickselect/
implementation 'org.webjars.npm:quickselect:2.0.0'
// https://jarcasting.com/artifacts/org.webjars.npm/quickselect/
implementation ("org.webjars.npm:quickselect:2.0.0")
'org.webjars.npm:quickselect:jar:2.0.0'
<dependency org="org.webjars.npm" name="quickselect" rev="2.0.0">
  <artifact name="quickselect" type="jar" />
</dependency>
@Grapes(
@Grab(group='org.webjars.npm', module='quickselect', version='2.0.0')
)
libraryDependencies += "org.webjars.npm" % "quickselect" % "2.0.0"
[org.webjars.npm/quickselect "2.0.0"]

Dependencies

There are no dependencies for this project. It is a standalone project that does not depend on any other jars.

Project Modules

There are no modules declared in this project.

quickselect Build Status

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

quickselect(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:

var arr = [65, 28, 59, 33, 21, 56, 22, 95, 50, 12, 90, 53, 28, 77, 39];

quickselect(arr, 8);

// arr is [39, 28, 28, 33, 21, 12, 22, 50, 53, 56, 59, 65, 90, 77, 95]
//                                         ^^ middle index

Versions

Version
2.0.0