Gecko [ www.leshallesdegournay.geraud-market.com ]

Linux worldls-302.fr.planethoster.net 4.18.0-553.8.1.lve.el7h.x86_64 #1 SMP Thu Jul 4 15:19:33 UTC 2024 x86_64
LiteSpeed
Server IP : 10.185.0.203 & Your IP : 216.73.216.32
Domains : Cant Read [ /etc/named.conf ]
User : gerathty

Name	Size	Permission	Date
assert.awk	382 B	-rw-r--r--	2017-06-28 20:16
bits2str.awk	327 B	-rw-r--r--	2017-06-28 20:16
cliff_rand.awk	307 B	-rw-r--r--	2017-06-28 20:16
ctime.awk	233 B	-rw-r--r--	2017-06-28 20:16
ftrans.awk	317 B	-rw-r--r--	2017-06-28 20:16
getopt.awk	2.18 KB	-rw-r--r--	2017-06-28 20:16
gettime.awk	2.43 KB	-rw-r--r--	2017-06-28 20:16
group.awk	1.75 KB	-rw-r--r--	2017-06-28 20:16
join.awk	378 B	-rw-r--r--	2017-06-28 20:16
libintl.awk	238 B	-rw-r--r--	2017-06-28 20:16
noassign.awk	425 B	-rw-r--r--	2017-06-28 20:16
ord.awk	937 B	-rw-r--r--	2017-06-28 20:16
passwd.awk	1.17 KB	-rw-r--r--	2017-06-28 20:16
quicksort.awk	1023 B	-rw-r--r--	2017-06-28 20:16
readable.awk	492 B	-rw-r--r--	2017-06-28 20:16
rewind.awk	404 B	-rw-r--r--	2017-06-28 20:16
round.awk	661 B	-rw-r--r--	2017-06-28 20:16
strtonum.awk	1.43 KB	-rw-r--r--	2017-06-28 20:16
walkarray.awk	214 B	-rw-r--r--	2017-06-28 20:16
zerofile.awk	424 B	-rw-r--r--	2017-06-28 20:16

Rename

# quicksort.awk --- Quicksort algorithm, with user-supplied
#                   comparison function
#
# Arnold Robbins, arnoldskeeve.com, Public Domain
# January 2009
# quicksort --- C.A.R. Hoare's quick sort 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
}