uawdijnntqw1x1x1
IP : 18.227.79.241
Hostname : ns1.eurodns.top
Kernel : Linux ns1.eurodns.top 4.18.0-553.5.1.lve.1.el7h.x86_64 #1 SMP Fri Jun 14 14:24:52 UTC 2024 x86_64
Disable Function : mail,sendmail,exec,passthru,shell_exec,system,popen,curl_multi_exec,parse_ini_file,show_source,eval,open_base,symlink
OS : Linux
PATH:
/
home
/
sudancam
/
..
/
..
/
usr
/
share
/
locale
/
nic
/
..
/
son
/
..
/
tk
/
..
/
af
/
..
/
te
/
..
/
bik
/
..
/
day
/
..
/
nah
/
..
/
hil
/
..
/
sem
/
..
/
niu
/
..
/
am
/
..
/
nso
/
..
/
chr
/
..
/
pl_PL
/
..
/
hmn
/
..
/
kpe
/
..
/
de_AT
/
..
/
zh
/
..
/
it_IT
/
..
/
chg
/
..
/
io
/
..
/
be@latin
/
..
/
cu
/
..
/
..
/
awk
/
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 }
/home/sudancam/../../usr/share/locale/nic/../son/../tk/../af/../te/../bik/../day/../nah/../hil/../sem/../niu/../am/../nso/../chr/../pl_PL/../hmn/../kpe/../de_AT/../zh/../it_IT/../chg/../io/../be@latin/../cu/../../awk/quicksort.awk