Linux vps-61133.fhnet.fr 4.9.0-19-amd64 #1 SMP Debian 4.9.320-2 (2022-06-30) x86_64
Apache/2.4.25 (Debian)
Server IP : 93.113.207.21 & Your IP : 216.73.216.112
Domains :
Cant Read [ /etc/named.conf ]
User : www-data
Terminal
Auto Root
Create File
Create Folder
Localroot Suggester
Backdoor Destroyer
Readme
/
usr /
share /
doc /
mawk /
examples /
Delete
Unzip
Name
Size
Permission
Date
Action
ct_length.awk
407
B
-rwxr-xr-x
2012-03-23 21:15
decl.awk
2.97
KB
-rw-r--r--
2012-03-23 21:15
deps.awk
1.28
KB
-rw-r--r--
2012-03-23 21:15
eatc.awk
492
B
-rw-r--r--
2012-03-23 21:15
gdecl.awk
2.72
KB
-rw-r--r--
2012-03-23 21:15
hcal.gz
4.92
KB
-rw-r--r--
2012-03-23 21:15
hical
3.12
KB
-rwxr-xr-x
2012-03-23 21:15
nocomment.awk
590
B
-rw-r--r--
2012-03-23 21:15
primes.awk
1.03
KB
-rw-r--r--
2012-03-23 21:15
qsort.awk
1.07
KB
-rw-r--r--
2012-03-23 21:15
Save
Rename
#!/usr/bin/mawk -f # qsort text files # function middle(x,y,z) #return middle of 3 { if ( x <= y ) { if ( z >= y ) return y if ( z < x ) return x return z } if ( z >= x ) return x if ( z < y ) return y return z } function isort(A , n, i, j, hold) { # if needed a sentinal at A[0] will be created for( i = 2 ; i <= n ; i++) { hold = A[ j = i ] while ( A[j-1] > hold ) { j-- ; A[j+1] = A[j] } A[j] = hold } } # recursive quicksort function qsort(A, left, right ,i , j, pivot, hold) { pivot = middle(A[left], A[int((left+right)/2)], A[right]) i = left j = right while ( i <= j ) { while ( A[i] < pivot ) i++ while ( A[j] > pivot ) j-- if ( i <= j ) { hold = A[i] A[i++] = A[j] A[j--] = hold } } if ( j - left > BLOCK ) qsort(A,left,j) if ( right - i > BLOCK ) qsort(A,i,right) } BEGIN { BLOCK = 5 } { line[NR] = $0 "" # sort as string } END { if ( NR > BLOCK ) qsort(line, 1, NR) isort(line, NR) for(i = 1 ; i <= NR ; i++) print line[i] }