add immoweb ui
This commit is contained in:
parent
7e8c79d3d1
commit
151da16c27
266 changed files with 264879 additions and 0 deletions
26
immoweb/node_modules/quickselect/README.md
generated
vendored
Normal file
26
immoweb/node_modules/quickselect/README.md
generated
vendored
Normal file
|
|
@ -0,0 +1,26 @@
|
|||
## quickselect
|
||||
|
||||
A tiny and fast [selection algorithm](https://en.wikipedia.org/wiki/Selection_algorithm) in JavaScript
|
||||
(specifically, [Floyd-Rivest selection](https://en.wikipedia.org/wiki/Floyd%E2%80%93Rivest_algorithm)).
|
||||
|
||||
```js
|
||||
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:
|
||||
|
||||
```js
|
||||
var arr = [65, 28, 59, 33, 21, 56, 22, 95, 50, 12, 90, 53, 28, 77, 39];
|
||||
quickselect(arr, 8);
|
||||
// [39, 28, 28, 33, 21, 12, 22, 50, 53, 56, 59, 65, 90, 77, 95]
|
||||
// ^^ 8th item
|
||||
```
|
||||
Loading…
Add table
Add a link
Reference in a new issue