Linux unitednationsplay.com 3.10.0-1160.45.1.el7.x86_64 #1 SMP Wed Oct 13 17:20:51 UTC 2021 x86_64
nginx/1.20.1
Server IP : 188.130.139.92 & Your IP : 3.145.175.71
Domains :
Cant Read [ /etc/named.conf ]
User : web
Terminal
Auto Root
Create File
Create Folder
Localroot Suggester
Backdoor Destroyer
Readme
/
usr /
share /
awk /
Delete
Unzip
Name
Size
Permission
Date
Action
assert.awk
382
B
-rw-r--r--
2017-06-28 21:52
bits2str.awk
327
B
-rw-r--r--
2017-06-28 21:52
cliff_rand.awk
307
B
-rw-r--r--
2017-06-28 21:52
ctime.awk
233
B
-rw-r--r--
2017-06-28 21:52
ftrans.awk
317
B
-rw-r--r--
2017-06-28 21:52
getopt.awk
2.18
KB
-rw-r--r--
2017-06-28 21:52
gettime.awk
2.43
KB
-rw-r--r--
2017-06-28 21:52
group.awk
1.75
KB
-rw-r--r--
2017-06-28 21:52
join.awk
378
B
-rw-r--r--
2017-06-28 21:52
libintl.awk
238
B
-rw-r--r--
2017-06-28 21:52
noassign.awk
425
B
-rw-r--r--
2017-06-28 21:52
ord.awk
937
B
-rw-r--r--
2017-06-28 21:52
passwd.awk
1.17
KB
-rw-r--r--
2017-06-28 21:52
quicksort.awk
1023
B
-rw-r--r--
2017-06-28 21:52
readable.awk
492
B
-rw-r--r--
2017-06-28 21:52
rewind.awk
404
B
-rw-r--r--
2017-06-28 21:52
round.awk
661
B
-rw-r--r--
2017-06-28 21:52
strtonum.awk
1.43
KB
-rw-r--r--
2017-06-28 21:52
walkarray.awk
214
B
-rw-r--r--
2017-06-28 21:52
zerofile.awk
424
B
-rw-r--r--
2017-06-28 21:52
Save
Rename
# 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 }