File Manager

X7ROOT File Manager

Current Path: /usr/share/awk

ðŸ“ ..
ðŸ“„ assert.awk(383 B)
ðŸ“„ bits2str.awk(334 B)
ðŸ“„ cliff_rand.awk(307 B)
ðŸ“„ ctime.awk(234 B)
ðŸ“„ ftrans.awk(315 B)
ðŸ“„ getopt.awk(2.15 KB)
ðŸ“„ gettime.awk(2.43 KB)
ðŸ“„ group.awk(1.72 KB)
ðŸ“„ have_mpfr.awk(221 B)
ðŸ“„ inplace.awk(1.95 KB)
ðŸ“„ intdiv0.awk(462 B)
ðŸ“„ join.awk(378 B)
ðŸ“„ libintl.awk(238 B)
ðŸ“„ noassign.awk(422 B)
ðŸ“„ ord.awk(937 B)
ðŸ“„ passwd.awk(1.17 KB)
ðŸ“„ processarray.awk(355 B)
ðŸ“„ quicksort.awk(1.01 KB)
ðŸ“„ readable.awk(489 B)
ðŸ“„ readfile.awk(267 B)
ðŸ“„ rewind.awk(404 B)
ðŸ“„ round.awk(661 B)
ðŸ“„ shellquote.awk(472 B)
ðŸ“„ strtonum.awk(1.42 KB)
ðŸ“„ walkarray.awk(214 B)
ðŸ“„ zerofile.awk(424 B)

Editing: quicksort.awk

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

X7ROOT File Manager

Editing: quicksort.awk

Upload File

Create Folder