I have done this based on the other post ....... all I need is too arrange the words entered
first the biggest word , then the smallest word and then the remaining word
please do tell me what ad to this

#include <iostream>

#include <vector>
#include <string>
#include <algorithm>
using namespace std;
int main()

{
std:string str, str2, str3;
std::cin >> str;
std::cin >> str2;
std::cin >> str3;
std::cout<<str.length()<<std::endl;
std::cout<<str2.length()<<std::endl;
std::cout<<str3.length()<<std::endl;
std::vector<std::string> strarray[3];
system ("pause");
return 0;

}
Nick Evan commented: "Gimme the code" -1

Why did you open another thread with the same question as before?

[edit] Only this time you stole the code from someone else

Why did you open another thread with the same question as before?

[edit] Only this time you stole the code from someone else

hey i no i am using the other post but its incomplete .... as I said I need to Arrange the biggest word first and then smallest word and the remaining word
I cant sem to d it

Apparently not. Did you even try?
So far you have showed us 2 snippets of code that were written by someone else.
The rules here on Daniweb state that you will not receive homework-help unless you show some effort.

So what did YOU try so far, or what part are you having trouble with?

put the longest string in strarray[0], the shortest in strarray[1] and the third string in strarray[2]. Then you can easily print each of the three strings in order they appear in that array.

How do you find out which string is the longest? Here is an example

std::string shortest, longest, other;
longest = str;
if( str1.length() > longest.length() )
    longest = str1;
if(str2.length() > longest.length() )
    longest = str2;
// now make the same tests for shortest
Be a part of the DaniWeb community

We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.