C / C++ / MFC

int main()
{
	string str[8] = {"zxc", "zxc", "asd", "qwe", "zxc", "asd", "qwe", "jkl"};
	vector<string> v_str;
	string t_str;
	int iNum = 0;

	for(int i = 0; i < 8; i++)
		v_str.push_back(str[i]);

	for(int i = 1; i < v_str.size(); i++)
		for(int j = v_str.size() - 1; j >= i; j--)
			if(v_str[j - 1] > v_str[j])
			{
				t_str = v_str[j - 1];
				v_str[j - 1] = v_str[j];
				v_str[j] = t_str;
			}

	for(int i = 0; i < v_str.size(); i++)
		cout << v_str[i] << endl;

	return 0;
}

std::sort(v_str.begin(), v_str.end())

cur = vec[0]
maxrep = 1
maxstring = cur
currep = 1

for each item in vec, starting at vec[1]
  if item==cur
   currep++ // we have a repeat, keep track of how many repetitions
  else 
   // the strings are different,
   if currep > maxrep  // was this repetition count higher than the max
     maxrep=currep     // it is the new max
     maxstring=cur
   cur=item  // next item is current
   currep = 0

int main()
{
	string str[8] = {"zxc", "zxc", "asd", "qwe", "qwe", "asd", "qwe", "jkl"};
	vector<string> v_str;
	string t_str, maxstring;
	int maxrep = 1;
	int currep = 1;

	for(int i = 0; i < 8; i++)
		v_str.push_back(str[i]);

	for(int i = 1; i < v_str.size(); i++)
		for(int j = v_str.size() - 1; j >= i; j--)
			if(v_str[j - 1] > v_str[j])
			{
				t_str = v_str[j - 1];
				v_str[j - 1] = v_str[j];
				v_str[j] = t_str;
			}

	t_str = v_str[0];
	maxstring = t_str;

	for(int i = 1; i < v_str.size(); i++)
	{
		if(v_str[i] == t_str)
			currep++;
		else if(currep > maxrep)
		{
			maxrep = currep;
			maxstring = t_str;
		}

		t_str = v_str[i];
		currep = 0;
	}

	for(int i = 0; i < v_str.size(); i++)
		cout << v_str[i] << endl;

	cout << endl;

	cout << t_str << endl;
	cout << maxrep << endl;

	return 0;
}

else if(currep > maxrep)
{
    maxrep = currep;
    maxstring = t_str;
}

t_str = v_str[i];
currep = 0;

else
{
    if(currep > maxrep)
    {
        maxrep = currep;
        maxstring = t_str;
    }

    t_str = v_str[i];
    currep = 0;
}

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
	string str[8] = {"zxc", "zxc", "asd", "qwe", "qwe", "asd", "qwe", "jkl"};
	vector<string> v_str;
	string t_str, maxstring;
	int maxrep = 1;
	int currep = 1;
 
	for(int i = 0; i < 8; i++)
		v_str.push_back(str[i]);
 
	sort(v_str.begin(), v_str.end());
 
	t_str = v_str[0];
	maxstring = t_str;
 
	for(int i = 1; i < v_str.size(); i++)
	{
		if(t_str == v_str[i])
			currep++;
		else
		{
			if(currep > maxrep)
			{
				maxrep = currep;
				maxstring = t_str;
			}

			t_str = v_str[i];
			currep = 0;
		}
	}

	for(int i = 0; i < v_str.size(); i++)
		cout << v_str[i] << endl;
 
	cout << endl;
	cout << maxstring << " " << maxrep << endl;
 
	return 0;
}

TCPMem wrote:

currep = 0;

TCPMem wrote:

I did it. Now how to see which element repeats the most and how many times?

string str[8] = {"zxc", "zxc", "asd", "qwe", "zxc", "asd", "qwe", "jkl"};
vector<string> v_strAll;
vector<string> v_strUnique;
list<pair<string,size_t>> counts;

v_strAll.assign(str,str+_countof(str));
sort(v_strAll.begin(),v_strAll.end());
unique_copy(v_strAll.begin(),v_strAll.end(),back_inserter(v_strUnique));

std::vector<string>::iterator it = v_strUnique.begin();
while(it != v_strUnique.end())
{
	counts.push_back(make_pair(*it,count_if(v_strAll.begin(),v_strAll.end(),[it](const std::string& s1){return s1 == *it;})));
	++it;
}

for_each(v_strUnique.begin(),v_strUnique.end(),[&counts,v_strAll](const std::string& str){counts.push_back(make_pair(str,count_if(v_strAll.begin(),v_strAll.end(),[str](const std::string& s1){return s1 == str;})));});

ifstream file("file.dat");

vector<string> lines;
string line;

while (getline(file, line))
    lines.push_back(line);

Quote:

A pointer to the given control or child window. If no control with the integer ID given by the nID parameter exists, the value is NULL.