I am in need of some help with a homework assignment. It's basically creating a file indexer using C++.
I have 2 separate files that I need to read in: one is a text document and the other is a Skip words key. I am incredibly confused about how to approach this.
I know how to read both of them in and place them into separate containers (I plan on using vectors) but I just don't know how to combine them so that the Skip words text that line up with the document text won't be displayed (do I combine them into a map?).
I then need to display words that weren't in the skipWords doc in alphabetical order (I plan on using a vector and just sorting them) and output each location they appear.
Here is the doc file:
The quick brown fox
jumped over the lazy blue
fox. I can not believe I wrote such
a common phrase.
Where or where are you tonight?
Why did you leave me here all
I searched the world over
and thought I found true love.
and here is the skipWords file:
Can someone offer a stepping stone? I'm good at figuring it out if people just ask me the right questions :) I'm not asking for code, just guidance. Thank you so much in advance!
This is what I have so far. The Indexer header is just going to announce my prototypes and that's it. I don't intend on using any constructors. All I have is just reading the files in and placing them into separate vectors.
What do want to do? Is it printing the doc's words by skip the words in skipWords file and with sorting?(Sorry, my english is not much good. Maybe I misunderstand it.)
after you read 2 files stored in 2 vectors.
You have to run doubled-loop for deleting the doc's word.
1 2 3 4 5 6 7 8 9 10 11
for i=0 to doc.len :
for j=0 to skip.len :
if doc[i] == skip[i] :
//mark doc[i] as skipped or delete it
sort doc // have to decide what'll do with skipped word in the vector
I don't know why have to sort before printing, non-sense accept that you're just wanted to use the sort function.
the easiest.. make tokens of each files words and keep them in vector or list. Remember additions would be faster in list but searching would be sequential and vice versa for vectors. As the vector size increases, the additions could take more time. In case you want to optimize it before hand :-) .
lets call them document vector and skip word vector.
iterate the document vector, pick each word one by one, search that word in skip word vector. If found, do not print and continue to the next word. If not found, print it and move on to the next word in document vector.
Those will automatically maintain their contents sorted (one eliminating duplicates and the other keeping them) and that enables fast look up, via binary search, in O(log n).
The input you've mentioned won't make such algorithmic improvements obvious, or even noticeable, but if your course included discussions about the various STL containers and their pros/cons, efficiency of operations might be something you want to demonstrate that you've learned.