Welcome to collectivesolver - Programming & Software Q&A with code examples. A website with trusted programming answers. All programs are tested and work.

Contact: aviboots(AT)netvision.net.il

Buy a domain name - Register cheap domain names from $0.99 - Namecheap

Scalable Hosting That Grows With You

Secure & Reliable Web Hosting, Free Domain, Free SSL, 1-Click WordPress Install, Expert 24/7 Support

Semrush - keyword research tool

Boost your online presence with premium web hosting and servers

Disclosure: My content contains affiliate links.

39,914 questions

51,847 answers

573 users

How to find the most frequent word in an array of strings with C++

3 Answers

0 votes
#include <iostream>

void mostFrequentWord(std::string words[], int size) {
    int frequency = 0;
    std::string frequent_word;
 
    for (int i = 0; i < size; i++) {
        int count = 1;
        for (int j = i + 1; j < size; j++) {
            if (words[j] == words[i]) {
                count++;
            }
        }
        if (count >= frequency) {
            frequent_word = words[i];
            frequency = count;
        }
    }
 
    std::cout << frequent_word << ": " << frequency << " times";
}
 
int main()
{
    std::string arr[]  = { 
                    "java", 
                    "c++",
                    "c",
                    "c#",
                    "c",
                    "go",
                    "php",
                    "java",
                    "java",
                    "c",
                    "python",
                    "php",
                    "c" };
    
    int size = sizeof(arr) / sizeof(arr[0]);
 
    mostFrequentWord(arr, size);
}



/*
run:
 
c: 4 times
 
*/

 



answered Dec 31, 2023 by avibootz
0 votes
#include <iostream>
 
void mostFrequentWord(std::string words[], int size, int *frequency, std::string& frequent_word) {

  
    for (int i = 0; i < size; i++) {
        int count = 1;
        for (int j = i + 1; j < size; j++) {
            if (words[j] == words[i]) {
                count++;
            }
        }
        if (count >= *frequency) {
            frequent_word = words[i];
            *frequency = count;
        }
    }
}
  
int main()
{
    std::string arr[]  = { 
                    "java", 
                    "c++",
                    "c",
                    "c#",
                    "c",
                    "go",
                    "php",
                    "java",
                    "java",
                    "c",
                    "python",
                    "php",
                    "c" };
     
    int size = sizeof(arr) / sizeof(arr[0]);
    int frequency = 0;
    std::string frequent_word;
  
    mostFrequentWord(arr, size, &frequency, frequent_word);

    std::cout << frequent_word << ": " << frequency << " times";
}
 
 
 
/*
run:
  
c: 4 times
  
*/

 



answered Dec 31, 2023 by avibootz
0 votes
#include <iostream>
 
 std::string mostFrequentWord(std::string words[], int size) {
    int frequency = 0;
    std::string frequent_word;
  
    for (int i = 0; i < size; i++) {
        int count = 1;
        for (int j = i + 1; j < size; j++) {
            if (words[j] == words[i]) {
                count++;
            }
        }
        if (count >= frequency) {
            frequent_word = words[i];
            frequency = count;
        }
    }
    
    return frequent_word;
}
  
int main()
{
    std::string arr[]  = { 
                    "java", 
                    "c++",
                    "c",
                    "c#",
                    "c",
                    "go",
                    "php",
                    "java",
                    "java",
                    "c",
                    "python",
                    "php",
                    "c" };
     
    int size = sizeof(arr) / sizeof(arr[0]);

  
    std::string frequent_word = mostFrequentWord(arr, size);

    std::cout << frequent_word;
}
 
 
 
 
/*
run:
  
c
  
*/

 



answered Jan 1, 2024 by avibootz

Related questions

...