Linux cpanel.rrshost.in 5.15.0-25-generic #25-Ubuntu SMP Wed Mar 30 15:54:22 UTC 2022 x86_64
Apache
: 109.123.238.221 | : 172.70.80.75
128 Domain
8.2.28
aev999
Terminal
AUTO ROOT
Adminer
Backdoor Destroyer
Linux Exploit
Lock Shell
Lock File
Create User
CREATE RDP
PHP Mailer
BACKCONNECT
HASH IDENTIFIER
README
+ Create Folder
+ Create File
/
usr /
share /
doc /
gawk /
examples /
prog /
[ HOME SHELL ]
Name
Size
Permission
Action
alarm.awk
2.31
KB
-rw-r--r--
anagram.awk
1.33
KB
-rw-r--r--
awksed.awk
515
B
-rw-r--r--
cut.awk
3.61
KB
-rw-r--r--
dupword.awk
507
B
-rw-r--r--
egrep.awk
1.91
KB
-rw-r--r--
extract.awk
1.84
KB
-rw-r--r--
guide.awk
165
B
-rw-r--r--
histsort.awk
283
B
-rw-r--r--
id.awk
1.22
KB
-rw-r--r--
igawk.sh
3.11
KB
-rw-r--r--
indirectcall.awk
1.91
KB
-rw-r--r--
labels.awk
1014
B
-rw-r--r--
pi.awk
341
B
-rw-r--r--
split.awk
1.17
KB
-rw-r--r--
tee.awk
770
B
-rw-r--r--
testbits.awk
736
B
-rw-r--r--
translate.awk
1.15
KB
-rw-r--r--
uniq.awk
2.64
KB
-rw-r--r--
wc.awk
1.45
KB
-rw-r--r--
wordfreq.awk
347
B
-rw-r--r--
Delete
Unzip
Zip
${this.title}
Close
Code Editor : anagram.awk
# anagram.awk --- An implementation of the anagram-finding algorithm # from Jon Bentley's "Programming Pearls," 2nd edition. # Addison Wesley, 2000, ISBN 0-201-65788-0. # Column 2, Problem C, section 2.8, pp 18-20. # # This program requires gawk 4.0 or newer. # Required gawk-specific features: # - True multidimensional arrays # - split() with "" as separator splits out individual characters # - asort() and asorti() functions # # See https://savannah.gnu.org/projects/gawk. # # Arnold Robbins # arnold@skeeve.com # Public Domain # January, 2011 /'s$/ { next } # Skip possessives { key = word2key($1) # Build signature data[key][$1] = $1 # Store word with signature } # word2key --- split word apart into letters, sort, and join back together function word2key(word, a, i, n, result) { n = split(word, a, "") asort(a) for (i = 1; i <= n; i++) result = result a[i] return result } END { sort = "sort" for (key in data) { # Sort words with same key nwords = asorti(data[key], words) if (nwords == 1) continue # And print. Minor glitch: trailing space at end of each line for (j = 1; j <= nwords; j++) printf("%s ", words[j]) | sort print "" | sort } close(sort) }
Close