You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: readme.md
+5
Original file line number
Diff line number
Diff line change
@@ -13,4 +13,9 @@ Discussion, benchmarks and usage in https://duvanenko.tech.blog/2017/06/15/faste
13
13
This is a stable sort, while JavaScript built-in is not stable. This sort algorithm is not in-place, returning a new sorted array.
14
14
Discussion, benchmarks and usage in https://duvanenko.tech.blog/2017/07/10/sorting-arrays-of-objects-in-javascript-with-radix-sort/
15
15
16
+
When you benchmark these algorithms keep in mind that for the first one or two runs a basic JavaScript compiler is used, providing fast
17
+
time to start up and to give time for the full optimizing compiler to run. After these two runs optimized code starts being used,
18
+
revealing the full performance of LSD Radix Sort. See https://blog.sessionstack.com/how-javascript-works-inside-the-v8-engine-5-tips-on-how-to-write-optimized-code-ac089e62b12e
19
+
for more details about the JIT engine in Chrome.
20
+
16
21
If you have a specific needs for higher performance algorithms, let us know.
0 commit comments