3 ms·
> removing function calls altogether (not the one in comparator but the recursive qsort calls). That's an impressive feat as quick sort is not tail recursive.
by gpderetta 10y ago
> removing function calls altogether (not the one in comparator but the recursive qsort calls).
That's an impressive feat as quick sort is not tail recursive.
Edit: you can of course maintain the recursion stack by hand but that's not normally a win.
- bluecalm 10y agoI am not sure why you think it's not normally a win. It is quite a big win in qsort implementation at least.