sort question

[zcrself]

#include <iostream>
#include <algorithm>
#include <vector>
#include <string> 
using namespace std;
int main() 
{
  std::vector<string> vec;
  vec.push_back("dd"); vec.push_back("adfd"); vec.push_back("aaa"); 
  vec.push_back("aa"); 
  std::sort(vec.begin(), vec.end());
  for (int i = 0; i < vec.size(); ++i) 
     std::cout << vec[i] << ' ';
}

I want to output
aa
dd
aaa
adfd


How to design codes?

[MutantJohn]

What does that code output now?

[laserlight]

You should write a custom comparator that takes the length of the strings being compared into consideration.

[zcrself]

What does that code output now?

aa aaa adfd dd

[laserlight]

Have you tried my suggestion?

[MutantJohn]

aa aaa adfd dd

Ah, I see. Then you should without a doubt follow laserlight's advice and use a custom comparator that incorporates string length. I think std::sort() actually has an implementation of this, doesn't it? It's something with an argument list like std::sort(iterator & A, iterator & B, comparison_function), isn't it? That way you can sort by string length as well.

[Elysia]

Yes, it has an overloaded function that takes a comparator as a 3rd argument.
std::sort - cppreference.com
The other alternative would be to overload operator < for the type you're trying to sort (unless it's a built-in such as int, std::string, etc).

[zcrself]

Have you tried my suggestion?

I do appreciate your suggestion, thanks a lot

bool cmp1(string a, string b)
{
    if(a.length()==b.length())
    {
         return a < b;
    }else
    {
         return a.length() < b.length();
    }
}

std::sort(vec.begin(), vec.end(),cmp1);

[zcrself]

Yes, it has an overloaded function that takes a comparator as a 3rd argument.
std::sort - cppreference.com
The other alternative would be to overload operator < for the type you're trying to sort (unless it's a built-in such as int, std::string, etc).

thanks for your suggestion!

[whiteflags]

More succinctly put, this seems to work:

return a.length() <= b.length() && a < b;

[laserlight]

More succinctly put, this seems to work:

return a.length() <= b.length() && a < b;

Assuming an ASCII-based character set, zcrself's code will return true for cmp1("b", "ab"). Your expression will evaluate to false instead. Furthermore, your expression will also evaluate to false for cmp1("ab", "b"), i.e., it indicates that "b" and "ab" are equal according to your comparator.

[zcrself]

More succinctly put, this seems to work:

return a.length() <= b.length() && a < b;

bool cmp1(string a, string b)
{
     return a.length() <= b.length() && a < b;
}
int main()
{
  std::vector<string> vec;
  vec.push_back("ab"); vec.push_back("b"); vec.push_back("aaa");
  vec.push_back("aa");
  std::sort(vec.begin(), vec.end(),cmp1);
  for (int i = 0; i < vec.size(); ++i)
     std::cout << vec[i] << ' ';
}

output is:

aa ab b aaa

[rcgldr]

output is:

aa ab b aaa

I think the output is supposed to be

b aa ab aaa

which what zcrself's version does.

[zcrself]

I think the output is supposed to be

b aa ab aaa

which what zcrself's version does.

Dev-c++ 4.9.9.2

windows xp