Gecko [ sachasauda.akalacademy.ac.in ]

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

Name

Size

Permission

Action

assert.awk

382 B

-rw-r--r--

bits2str.awk

327 B

-rw-r--r--

cliff_rand.awk

307 B

-rw-r--r--

ctime.awk

233 B

-rw-r--r--

ftrans.awk

317 B

-rw-r--r--

getopt.awk

2.18 KB

-rw-r--r--

gettime.awk

2.43 KB

-rw-r--r--

group.awk

1.75 KB

-rw-r--r--

join.awk

378 B

-rw-r--r--

libintl.awk

238 B

-rw-r--r--

noassign.awk

425 B

-rw-r--r--

ord.awk

937 B

-rw-r--r--

passwd.awk

1.17 KB

-rw-r--r--

quicksort.awk

1023 B

-rw-r--r--

readable.awk

492 B

-rw-r--r--

rewind.awk

404 B

-rw-r--r--

round.awk

661 B

-rw-r--r--

strtonum.awk

1.43 KB

-rw-r--r--

walkarray.awk

214 B

-rw-r--r--

zerofile.awk

424 B

-rw-r--r--

Code Editor : quicksort.awk

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

${this.title}

Code Editor : quicksort.awk