Gecko [ www.ctm-euromeuble.fr ]

Linux vps-61133.fhnet.fr 4.9.0-19-amd64 #1 SMP Debian 4.9.320-2 (2022-06-30) x86_64
Apache/2.4.25 (Debian)
Server IP : 93.113.207.21 & Your IP : 216.73.216.122
Domains : Cant Read [ /etc/named.conf ]
User : www-data

Name	Size	Permission	Date
assert.awk	383 B	-rw-r--r--	2016-08-25 05:14
bits2str.awk	330 B	-rw-r--r--	2016-08-25 05:14
cliff_rand.awk	307 B	-rw-r--r--	2016-08-25 05:14
ctime.awk	234 B	-rw-r--r--	2016-08-25 05:14
ftrans.awk	315 B	-rw-r--r--	2016-08-25 05:14
getopt.awk	2.15 KB	-rw-r--r--	2016-08-25 05:14
gettime.awk	2.43 KB	-rw-r--r--	2016-08-25 05:14
grcat.c	1004 B	-rw-r--r--	2016-08-25 05:14
groupawk.in	1.73 KB	-rw-r--r--	2016-08-25 05:14
inplace.awk	1.04 KB	-rw-r--r--	2016-08-25 05:14
join.awk	378 B	-rw-r--r--	2016-08-25 05:14
libintl.awk	238 B	-rw-r--r--	2016-08-25 05:14
noassign.awk	422 B	-rw-r--r--	2016-08-25 05:14
ord.awk	937 B	-rw-r--r--	2016-08-25 05:14
passwdawk.in	1.18 KB	-rw-r--r--	2016-08-25 05:14
processarray.awk	355 B	-rw-r--r--	2016-08-25 05:14
pwcat.c	824 B	-rw-r--r--	2016-08-25 05:14
quicksort.awk	1.01 KB	-rw-r--r--	2016-08-25 05:14
readable.awk	489 B	-rw-r--r--	2016-08-25 05:14
readfile.awk	267 B	-rw-r--r--	2016-08-25 05:14
rewind.awk	404 B	-rw-r--r--	2016-08-25 05:14
round.awk	661 B	-rw-r--r--	2016-08-25 05:14
shellquote.awk	472 B	-rw-r--r--	2016-08-25 05:14
strtonum.awk	1.42 KB	-rw-r--r--	2016-08-25 05:14
walkarray.awk	214 B	-rw-r--r--	2016-08-25 05:14
zerofile.awk	424 B	-rw-r--r--	2016-08-25 05:14

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
}