I forgot that you would need to instantiate a second parsing tree.
I attached the tests I made with sorts. Here is the output:
start: 162142.4207250000035855 qsort: 162142.9275999999954365 (0.506874999991850927472) bsort: 162144.6809749999956693 (1.753375000000232830643)
@TiCPU started
Espruino is a JavaScript interpreter for low-power Microcontrollers. This site is both a support community for Espruino and a place to share what you are working on.
I forgot that you would need to instantiate a second parsing tree.
I attached the tests I made with sorts. Here is the output: