fix: new sorting algorithm

[MaxGraey]

New sorting algorithm based on "Power Sort" from "Nearly-Optimal Mergesorts" (May 2018) paper (https://arxiv.org/pdf/1805.04154.pdf). Also this implementation contains highly optimized novel insertion sort as part of main algorithm.

The previous algorithm was unstable which forced us to do fallback on the slow insertion sort for reference types for following ECMAScript spec. Which, of course, was very undesirable.

Features:

• Stable

• Faster than TimSort (approx 1.5-2x)

• Faster than JS sort (TimSort) (approx 5x)

• Has a mathematical proof of correctness, unlike TimSort (See paper)

• I've read the contributing guidelines

[MaxGraey]

Benchmark sources:

AssemblyScript & JavaScript:
https://webassembly.studio/?f=8ehyqora2yn

Rust wasm:
https://webassembly.studio/?f=dfp7z1h91q8

Results:

Chrome 91

AS sort 100_000 doubles : 18.70 ms
AS sort 10_000_000 doubles: 5168.00 ms

AS NEW sort 100_000 doubles : 11.30 ms
AS NEW sort 10_000_000 doubles: 1591.20 ms

Rust (wasm) sort 100_000 doubles : 19.80 ms
Rust (wasm) sort 10_000_000 doubles: 2300.60 ms

JS sort 100_000 doubles : 43.20 ms
JS sort 10_000_000 doubles: 7835.60 ms

---

Firefox 89

AS sort 100_000 doubles : 22.00 ms
AS sort 10_000_000 doubles: 5436.00 ms

AS NEW sort 100_000 doubles : 12.00 ms
AS NEW sort 10_000_000 doubles: 1946.00 ms

Rust (wasm) sort 100_000 doubles : 23.00 ms
Rust (wasm) sort 10_000_000 doubles: 2793.00 ms

JS sort 100_000 doubles : 33.00 ms
JS sort 10_000_000 doubles: 4760.00 ms

---

Safari 14.2 TP

AS sort 100_000 doubles : 21.00 ms
AS sort 10_000_000 doubles: 5034.00 ms

AS NEW sort 100_000 doubles : 16.00 ms
AS NEW sort 10_000_000 doubles: 1876.00 ms

Rust (wasm) sort 100_000 doubles : 27.00 ms
Rust (wasm) sort 10_000_000 doubles: 2432.00 ms

JS sort 100_000 doubles : 23.00 ms
JS sort 10_000_000 doubles: 2792.00 ms

[JairusSW]

Yayy!

[dcodeIO]

Can't really comment on the algorithm yet, but have a few more general comments :)