Linux vmi2545633.contaboserver.net 6.1.0-32-amd64 #1 SMP PREEMPT_DYNAMIC Debian 6.1.129-1 (2025-03-06) x86_64
Apache/2.4.62 (Debian)
Server IP : 127.0.0.1 & Your IP : 127.0.0.1
Domains :
Cant Read [ /etc/named.conf ]
User : www-data
Terminal
Auto Root
Create File
Create Folder
Localroot Suggester
Backdoor Destroyer
Readme
/
usr /
share /
awk /
Delete
Unzip
Name
Size
Permission
Date
Action
assert.awk
383
B
-rw-r--r--
2023-02-19 13:30
bits2str.awk
334
B
-rw-r--r--
2023-02-19 13:30
cliff_rand.awk
307
B
-rw-r--r--
2023-02-19 13:30
ctime.awk
234
B
-rw-r--r--
2023-02-19 13:30
ftrans.awk
315
B
-rw-r--r--
2023-02-19 13:30
getopt.awk
3.2
KB
-rw-r--r--
2023-02-19 13:30
gettime.awk
2.43
KB
-rw-r--r--
2023-02-19 13:30
group.awk
1.74
KB
-rw-r--r--
2023-02-19 13:30
have_mpfr.awk
221
B
-rw-r--r--
2023-02-19 13:30
inplace.awk
2.29
KB
-rw-r--r--
2023-02-19 13:30
intdiv0.awk
462
B
-rw-r--r--
2023-02-19 13:30
isnumeric.awk
284
B
-rw-r--r--
2023-02-19 13:30
join.awk
378
B
-rw-r--r--
2023-02-19 13:30
libintl.awk
238
B
-rw-r--r--
2023-02-19 13:30
noassign.awk
422
B
-rw-r--r--
2023-02-19 13:30
ns_passwd.awk
1.25
KB
-rw-r--r--
2023-02-19 13:30
ord.awk
937
B
-rw-r--r--
2023-02-19 13:30
passwd.awk
1.18
KB
-rw-r--r--
2023-02-19 13:30
processarray.awk
355
B
-rw-r--r--
2023-02-19 13:30
quicksort.awk
1.01
KB
-rw-r--r--
2023-02-19 13:30
readable.awk
489
B
-rw-r--r--
2023-02-19 13:30
readfile.awk
267
B
-rw-r--r--
2023-02-19 13:30
rewind.awk
404
B
-rw-r--r--
2023-02-19 13:30
round.awk
661
B
-rw-r--r--
2023-02-19 13:30
shellquote.awk
472
B
-rw-r--r--
2023-02-19 13:30
strtonum.awk
1.42
KB
-rw-r--r--
2023-02-19 13:30
walkarray.awk
214
B
-rw-r--r--
2023-02-19 13:30
zerofile.awk
424
B
-rw-r--r--
2023-02-19 13:30
Save
Rename
# 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 }