9 ms·
binary-trees source secs Go 28.80 Lisp 8.49 You know what I would choose if I needed a garbage collected language. Btw,the lisp versi
by flavio81 8y ago
binary-trees
source secs
Go 28.80
Lisp 8.49
You know what I would choose if I needed a garbage collected language.
Btw,the lisp version uses no fancy tree allocator, just plain standard lisp lists.
- Thaxll 8y agoAnd yet Go is much faster than Lisp, you shouldn't look at that specific Benchmark.
- igouy 8y agoYou should look where the time goes in your app.
- PopsiclePete 8y agoBefore you do that, you might want to research GC 'throughput' vs GC 'latency'. Go chose to optimize for latency, not throughput. And for very good reasons.