OXIESEC PANEL
- Current Dir:
/
/
usr
/
share
/
awk
Server IP: 139.59.38.164
Upload:
Create Dir:
Name
Size
Modified
Perms
📁
..
-
11/10/2024 09:42:49 AM
rwxr-xr-x
📄
assert.awk
383 bytes
02/11/2018 05:02:41 AM
rw-r--r--
📄
bits2str.awk
330 bytes
02/11/2018 05:02:41 AM
rw-r--r--
📄
cliff_rand.awk
307 bytes
02/11/2018 05:02:41 AM
rw-r--r--
📄
ctime.awk
234 bytes
02/11/2018 05:02:41 AM
rw-r--r--
📄
ftrans.awk
315 bytes
02/11/2018 05:02:41 AM
rw-r--r--
📄
getopt.awk
2.15 KB
02/11/2018 05:02:41 AM
rw-r--r--
📄
gettime.awk
2.43 KB
02/11/2018 05:02:41 AM
rw-r--r--
📄
group.awk
1.74 KB
02/11/2018 05:02:41 AM
rw-r--r--
📄
inplace.awk
1.04 KB
02/11/2018 05:02:41 AM
rw-r--r--
📄
join.awk
378 bytes
02/11/2018 05:02:41 AM
rw-r--r--
📄
libintl.awk
238 bytes
02/11/2018 05:02:41 AM
rw-r--r--
📄
noassign.awk
422 bytes
02/11/2018 05:02:41 AM
rw-r--r--
📄
ord.awk
937 bytes
02/11/2018 05:02:41 AM
rw-r--r--
📄
passwd.awk
1.18 KB
02/11/2018 05:02:41 AM
rw-r--r--
📄
processarray.awk
355 bytes
02/11/2018 05:02:41 AM
rw-r--r--
📄
quicksort.awk
1.01 KB
02/11/2018 05:02:41 AM
rw-r--r--
📄
readable.awk
489 bytes
02/11/2018 05:02:41 AM
rw-r--r--
📄
readfile.awk
267 bytes
02/11/2018 05:02:41 AM
rw-r--r--
📄
rewind.awk
404 bytes
02/11/2018 05:02:41 AM
rw-r--r--
📄
round.awk
661 bytes
02/11/2018 05:02:41 AM
rw-r--r--
📄
shellquote.awk
472 bytes
02/11/2018 05:02:41 AM
rw-r--r--
📄
strtonum.awk
1.42 KB
02/11/2018 05:02:41 AM
rw-r--r--
📄
walkarray.awk
214 bytes
02/11/2018 05:02:41 AM
rw-r--r--
📄
zerofile.awk
424 bytes
02/11/2018 05:02:41 AM
rw-r--r--
Editing: quicksort.awk
Close
# 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 }