Computers and Technology, 25.12.2020 20:10 byejpg

Write a program that takes paragraph from the user and prints all unique words in that paragraph using strings in c++

Answers: 3

Show answers

Answers

Answer from: mmaglaya1

void printUniquedWords(char filename[])

void printUniquedWords(char filename[]) {

void printUniquedWords(char filename[]) { // Whatever your t.text file is

fstream fs(filename);

fstream fs(filename); map<string, int> mp;

fstream fs(filename); map<string, int> mp; // This serves to keep a record of the words

string word;

string word; while (fs >> word)

string word; while (fs >> word) {

string word; while (fs >> word) { // Verifies if this is the first time the word appears hence "unique word"

if (!mp.count(word))

if (!mp.count(word)) mp.insert(make_pair(word, 1));

if (!mp.count(word)) mp.insert(make_pair(word, 1)); else

if (!mp.count(word)) mp.insert(make_pair(word, 1)); else mp[word]++;

if (!mp.count(word)) mp.insert(make_pair(word, 1)); else mp[word]++; }

if (!mp.count(word)) mp.insert(make_pair(word, 1)); else mp[word]++; } fs.close();

if (!mp.count(word)) mp.insert(make_pair(word, 1)); else mp[word]++; } fs.close(); // Traverse map and print all words whose count

if (!mp.count(word)) mp.insert(make_pair(word, 1)); else mp[word]++; } fs.close(); // Traverse map and print all words whose count //is 1

if (!mp.count(word)) mp.insert(make_pair(word, 1)); else mp[word]++; } fs.close(); // Traverse map and print all words whose count //is 1 for (map<string, int> :: iterator p = mp.begin();

if (!mp.count(word)) mp.insert(make_pair(word, 1)); else mp[word]++; } fs.close(); // Traverse map and print all words whose count //is 1 for (map<string, int> :: iterator p = mp.begin(); p != mp.end(); p++)

Answer from: Quest

Explain what is meant by a limited data set and how this hipaa rule may affect medical assistants

Answer from: Quest

You probably find kind your i think

Another question on Computers and Technology

Computers and Technology, 22.06.2019 01:00

What is added to the < meta > tag to describe the encoding type?

Answers: 1

Answer

Computers and Technology, 22.06.2019 20:00

What is the worst-case complexity of the maxrepeats function? assume that the longest string in the names array is at most 25 characters wide (i.e., string comparison can be treated as o( class namecounter { private: int* counts; int nc; string* names; int nn; public: namecounter (int ncounts, int nnames); int maxrepeats() const; }; int namecounter: : maxrepeats () { int maxcount = 0; for (int i = 0; i < nc; ++i) { int count = 1; for (int j = i+1; j < nc; ++j) { if (names[i] == names[j]) ++count; } maxcount = max(count, maxcount); } return maxcount; }

Answers: 3

Answer

Computers and Technology, 23.06.2019 08:30

When you interpret the behavior of others according to your experiences and understanding of the world your evaluation is

Answers: 1

Answer

Computers and Technology, 24.06.2019 00:20

Describe a data structures that supports the stack push and pop operations and a third operation findmin, which returns the smallest element in the data structure, all in o(1) worst-case time.

Answers: 2

Answer

You know the right answer?

Write a program that takes paragraph from the user and prints all unique words in that paragraph usi...

Questions