Gecko [ www.jobworksschool.com ]

Linux jobworks 6.8.0-136-generic #136-Ubuntu SMP PREEMPT_DYNAMIC Wed Jul 1 21:53:05 UTC 2026 x86_64
Apache/2.4.58 (Ubuntu)
Server IP : 10.0.1.5 & Your IP : 216.73.217.52
Domains : Cant Read [ /etc/named.conf ]
User : www-data

Name	Size	Permission	Date
assert.awk	383 B	-rw-r--r--	2026-07-20 22:38
bits2str.awk	334 B	-rw-r--r--	2026-07-20 22:38
cliff_rand.awk	307 B	-rw-r--r--	2026-07-20 22:38
ctime.awk	234 B	-rw-r--r--	2026-07-20 22:38
ftrans.awk	315 B	-rw-r--r--	2026-07-20 22:38
getopt.awk	3.2 KB	-rw-r--r--	2026-07-20 22:38
gettime.awk	2.43 KB	-rw-r--r--	2026-07-20 22:38
group.awk	1.74 KB	-rw-r--r--	2026-07-20 22:38
have_mpfr.awk	221 B	-rw-r--r--	2026-07-20 22:38
inplace.awk	2.29 KB	-rw-r--r--	2026-07-20 22:38
intdiv0.awk	462 B	-rw-r--r--	2026-07-20 22:38
isnumeric.awk	284 B	-rw-r--r--	2026-07-20 22:38
join.awk	378 B	-rw-r--r--	2026-07-20 22:38
libintl.awk	238 B	-rw-r--r--	2026-07-20 22:38
noassign.awk	422 B	-rw-r--r--	2026-07-20 22:38
ns_passwd.awk	1.25 KB	-rw-r--r--	2026-07-20 22:38
ord.awk	937 B	-rw-r--r--	2026-07-20 22:38
passwd.awk	1.18 KB	-rw-r--r--	2026-07-20 22:38
processarray.awk	355 B	-rw-r--r--	2026-07-20 22:38
quicksort.awk	1.01 KB	-rw-r--r--	2026-07-20 22:38
readable.awk	489 B	-rw-r--r--	2026-07-20 22:38
readfile.awk	267 B	-rw-r--r--	2026-07-20 22:38
rewind.awk	404 B	-rw-r--r--	2026-07-20 22:38
round.awk	661 B	-rw-r--r--	2026-07-20 22:38
shellquote.awk	472 B	-rw-r--r--	2026-07-20 22:38
strtonum.awk	1.42 KB	-rw-r--r--	2026-07-20 22:38
walkarray.awk	214 B	-rw-r--r--	2026-07-20 22:38
zerofile.awk	424 B	-rw-r--r--	2026-07-20 22:38

Rename

# 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
}