Re^2: compute the occurrence of words

Hi Utilitarian yes I agree that hash is the best way to find the unique things, but BigGer is not trying to find the unique words, he tried in his code to counts the occurrence of each word.

Comment on Re^2: compute the occurrence of words

Replies are listed 'Best First'.
Re^3: compute the occurrence of words by Utilitarian (Vicar) on Feb 13, 2013 at 14:13 UTC
Perhaps I was unclear, one of the things you have to do in order to count the number of occurrences of each word in a given text is to create a list of the unique words present, the other thing you have to do is associate a count with each of these words. If you can think of a data structure more suited to this purpose than an associative array or hash, I'd be very interested. `print "Good ",qw(night morning afternoon evening)[(localtime)[2]/6]," fellow monks."`	[reply] [d/l]

Replies are listed 'Best First'.

Re^3: compute the occurrence of words
by Utilitarian (Vicar) on Feb 13, 2013 at 14:13 UTC

If you can think of a data structure more suited to this purpose than an associative array or hash, I'd be very interested.

print "Good ",qw(night morning afternoon evening)[(localtime)[2]/6]," fellow monks."

[reply]
[d/l]