Name	Size	Mode	Actions
assert.awk	383	0644	editdlrm
bits2str.awk	334	0644	editdlrm
cliff_rand.awk	307	0644	editdlrm
ctime.awk	234	0644	editdlrm
ftrans.awk	315	0644	editdlrm
getopt.awk	3278	0644	editdlrm
gettime.awk	2491	0644	editdlrm
group.awk	1778	0644	editdlrm
have_mpfr.awk	221	0644	editdlrm
inplace.awk	2340	0644	editdlrm
intdiv0.awk	462	0644	editdlrm
join.awk	378	0644	editdlrm
libintl.awk	238	0644	editdlrm
noassign.awk	422	0644	editdlrm
ns_passwd.awk	1282	0644	editdlrm
ord.awk	937	0644	editdlrm
passwd.awk	1212	0644	editdlrm
processarray.awk	355	0644	editdlrm
quicksort.awk	1031	0644	editdlrm
readable.awk	489	0644	editdlrm
readfile.awk	267	0644	editdlrm
rewind.awk	404	0644	editdlrm
round.awk	661	0644	editdlrm
shellquote.awk	472	0644	editdlrm
strtonum.awk	1454	0644	editdlrm
walkarray.awk	214	0644	editdlrm
zerofile.awk	424	0644	editdlrm

# quicksort.awk --- Quicksort algorithm, with user-supplied # comparison function # # Arnold Robbins, arnold@skeeve.com, Public Domain # January 2009 # quicksort --- C.A.R. Hoare's quicksort algorithm. See Wikipedia # or almost any algorithms or computer science text. # # Adapted from K&R-II, page 110 function quicksort(data, left, right, less_than, i, last) { if (left >= right) # do nothing if array contains fewer return # than two elements quicksort_swap(data, left, int((left + right) / 2)) last = left for (i = left + 1; i <= right; i++) if (@less_than(data[i], data[left])) quicksort_swap(data, ++last, i) quicksort_swap(data, left, last) quicksort(data, left, last - 1, less_than) quicksort(data, last + 1, right, less_than) } # quicksort_swap --- helper function for quicksort, should really be inline function quicksort_swap(data, i, j, temp) { temp = data[i] data[i] = data[j] data[j] = temp }