D7net Mini Sh3LL v1
Current File : //libx32/../share/snapd/../locale/ia/../../doc/info/../libroken18-heimdal/../usbmuxd/../liberror-perl/../grub2-common/../libjpeg8/../php7.4-mysql/../gnupg/../python3-apt/../netplan.io/../wget/../libcurl3-gnutls/../libthai-data/../python3-six/../screen/../maria/../libxaw7/../libunwind8/../python3/../libxslt1.1/../libtool/../libncursesw6/../libgvpr2/../libatasmart4/../debianutils/../libfdisk1/../gcc-9/../dbus/../libgd3/../libasan5/../libreadline5/../libxmlb1/../sos/../libapparmor1/../sysvinit-utils/../passwd/../libmount1/../thermald/../libc-bin/../systemd/../libasound2/../libfl2/../libtiff5/../dmsetup/../lsof/../libarchive-zip-perl/../libargon2-1/../openssh-sftp-server/../libblockdev2/../python3-debian/../strace/../libc-dev-bin/../php7.4-mysql/../libpackagekit-glib2-18/../iucode-tool/../libtool/../libargon2-1/../../awk/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
}
AnonSec - 2021 | Recode By D7net