| how to count no of occurrence ... | ||||||||||
|
30 Day Risk-Free Guarantee:
100% money back if you're unsatisfied. Book (308 Pages):
 Video (One Hour):
 Resume Review (24 - 48hr)
All Products / Services
|
||||||||||
Twitty on November 12, 2009
how to count no of occurrence of a particular word in a given file of text. [c/c++] And if file is very large hw will u go about it.
6
Question #246752 (Report Dup) | Edit
Anonymous
on November 13, 2009
you can use the data structure called Tries. It becomes trivial after that.
Unkown
on March 02, 2010
But IT will take alot of space..and it would be suitable if you would have to count all different words..
Gautam
on November 13, 2009
option A) InPlace Quick Sort on the words, then search using Binary Search.
Option B) Trie
If the numbers are words are too many then Trie will outdo QuickSort model. However Tire need lot more space than In-Place Quick Sort model.
sumit saxena
on March 18, 2010
use KMP or Boyer Moore string searching algo's to search the word and count.
Complexity O(n+m), n = size of text, m = size of pattern
nutcracker
on July 01, 2010
inverted file index
Add a Text Comment | Add Runnable Code
Follow CareerCup on Twitter
More from Glassdoor.com
Hashing (key = word, value = count); Could do it in a distributed way if hash table too large for memory.