Sorting algorithms/Quicksort: Difference between revisions

Content added Content deleted
m (added FunL)
Line 2,173:
start, endi = start or 1, endi or #t
--partition w.r.t. first element
if(endi - start < 21) then return t end
local pivot = start
for i = start + 1, endi do
Retrieved from "https://rosettacode.org/wiki/Sorting_algorithms/Quicksort"