word freq and length sorting.. need help.. stuck..

[rehet]

hye.. i really need ur guys help.. im stuck.. i want to count the word freq and print them according to the word length.. > the longest be output first..
ouh.. and my input must be alphabet or alhabet+numeric only..

here what i did so far..

#include <iostream>
#include <string>
#include <map>
using namespace std;
class Cmp : public std::binary_function<std::string,std::string,bool> {
public:
  bool operator()(const std::string& s1, const std::string& s2){ //????
  }
};
//typedef std::map<std::string, int, Cmp> MAP;
 
typedef enum {s1, s2} STATUS;
struct Count {
    int N;
    Count() : N(0) {}
    operator int() { return N; }
    void operator++() { N++; }
};
typedef map<string,Count> Map;
 
int main(void){
  char c;
  map<string,Count> m;
  std::string  buffer;
    STATUS status=s1;
//    while( cin >> str ) stringCounts[str]++; 
  while(std::cin >> c){
 
    switch(status){
    case s1:
      if(isalpha(c)){
//    m[string]++;
    buffer=c;
    status=s2;
 
      }
      break;
    case s2:
      if(isalnum(c)){
    buffer+=c;
      }else{
    //std::cout << s1 << s2 << std::endl;
 
    std::cout << c << buffer << std::endl;
    status=s1;
      }
 
      break;
    }
  }
  if(status=s2){
 
Map::iterator i = m.begin();
    while ( i != m.end() ) {
      cout << i->first << ':'
           << i->second << endl;
      ++i;
   std::cout << c << buffer << std::endl;
  }
 
 
}    
  return 0;
}

can you guys please help me..

[DeMan]

Just to make sure we're on the same page, do you mean you want to count the frequency of characters (alphabetic and numeral only) in a given input, and output them according to the most frequently occuring, or do you actually want to find the most common word (sequence of alphabetic/numeral characters),

I have assumed the first, and would suggest you make an array of 36 char/int values. Then choose to assign each possible numeral or alpha-character one of these array items. Using a case statement you can populate the array something along the lines of (in pseudocode of course, so I can't be accused of making syntactic mistakes):

int[] counts = new int[36] to initialise each to 0
while (we have more input)
{
  currentChar = getChar();
  switch (currentChar)
  {
    case '0'
      counts[0]++;
      break;
    case '1': //note the quote marks, we are referring to character not int value
      counts[1]++;
      break;
 /* (same for other numerals) */
 
    case 'a':
    case 'A':
      counts[10]++;
      break;
    case 'b':
    case 'B':
      counts[11]++;
/* Same for other alpha's */
  }
}
 

There are many ways to sort some easier than others, btu I'll leave you with this much so far (in case I got the wrong end of the stick) and you can ask more questions later, which I'm sure someone (possibly me again) can answer if you get stuck....

[rehet]

hye.. thanksss.. :d

but i finished it already..

#include <iostream>
#include <string>
#include <map>
using namespace std;
class Cmp : public std::binary_function<std::string,std::string,bool> {
public:
bool operator()(const std::string& s1, const std::string& s2){
 
int l1 = s1.length();
int l2 = s2.length();
if(l1==l2){
          return s1>s2;
          }
          else{
               return l1>l2;
               } 
 
}
};
typedef std::map<std::string, int, Cmp> MAP;
 
typedef enum {s1, s2} STATUS;
 
int main(void){
  char c;
  MAP m;
  std::string  buffer;
    STATUS status=s1;
 
  while(std::cin.get(c)){
 
    switch(status){
    case s1:
      if(isalpha(c)){
 
    buffer=c;
//m[buffer]++;
    status=s2;
 
      }
      break;
    case s2:
 
      if(isalnum(c)){
 
    buffer+=c;
      }else{
 
m[buffer]++;
    status=s1;
      }
 
      break;
    }
  }
  if(status=s2){
 
 
m[buffer]++;
  }
 
 
 
for(MAP::iterator i=m.begin(); i!=m.end(); ++i){
 
                  std::cout << i->first << ":" << i->second << std::endl;
 
 
}    
  return 0;
}