Skip to content

Commit

Permalink
Readme describing not in-place behavior of LSD Radix Sort
Browse files Browse the repository at this point in the history
  • Loading branch information
LAPTOP-465HP6VI\Victor committed Mar 25, 2019
1 parent ba0debe commit 69aecd0
Showing 1 changed file with 1 addition and 1 deletion.
2 changes: 1 addition & 1 deletion readme.md
Original file line number Diff line number Diff line change
Expand Up @@ -7,7 +7,7 @@ Let us know what other algorithms could use acceleration or improvement.

Faster and Better Algorithms, starting with high performance sorting:
- LSD Radix Sort for unsigned integer arrays. 20-30X faster than JavaScript's built-in array sort for arrays less than 35 Million.
5-10X faster for arrays greater than 35 Million. This sort algorithm is not in-place.
5-10X faster for arrays greater than 35 Million. This sort algorithm is not in-place, returning a new sorted array.
Discussion, benchmarks and example in https://duvanenko.tech.blog/2017/06/15/faster-sorting-in-javascript/
- LSD Radix Sort for arrays of user defined classes by an unsigned integer key. This is a stable sort,
while JavaScript built-in is not stable.
Expand Down

0 comments on commit 69aecd0

Please sign in to comment.