Quicksort for list of string

[aparnakakkar2003]

can any one tell me if I give the followiing string in input:
ABC
abc
BBC

then how I can get
ABC
abc
BBC
or

abc
ABC
BBC
as my output usiing quicksort.

[=?iso-8859-1?q?Erik_Wikstr=F6m?=]

On 19 Apr, 13:50, aparnakakkar2.. [e-mail] wrote:

can any one tell me if I give the followiing string in input:
ABC
abc
BBC

then how I can get
ABC
abc
BBC

or

abc
ABC
BBC
as my output usiing quicksort.

Don't know about quicksort but if it's sorting you want then given a
number of strings read from some input store them in a std::vector and
use std::sort() on them. Don't know the exact ordering of strings but
I'd guess that capital letters are sorted before lowercase letters so
the most likely result would be:

ABC
abc
BBC

--
Erik Wikström

[Victor Bazarov]

Erik Wikström wrote:

On 19 Apr, 13:50, aparnakakkar2.. [e-mail] wrote:

>can any one tell me if I give the followiing string in input:
ABC
abc
BBC

then how I can get
ABC
abc
BBC

or

abc
ABC
BBC
as my output usiing quicksort.

Don't know about quicksort but if it's sorting you want then given a
number of strings read from some input store them in a std::vector and
use std::sort() on them. Don't know the exact ordering of strings but
I'd guess that capital letters are sorted before lowercase letters so
the most likely result would be:

ABC
abc
BBC

*All* capital letters come before *any* lowercase ones. So, the result
*should* be

ABC
BBC
abc

V
--
Please remove capital 'A's when replying by e-mail
I do not respond to top-posted replies, please don't ask

[aparnakakkar2003]

On Apr 19, 6:42 pm, "Victor Bazarov" <v.Abaza...@com Acast.netwrote:

Erik Wikström wrote:

On 19 Apr, 13:50, aparnakakkar2.. [e-mail] wrote:

can any one tell me if I give the followiing string in input:
ABC
abc
BBC

then how I can get
ABC
abc
BBC

or

abc
ABC
BBC
as my output usiing quicksort.

Don't know about quicksort but if it's sorting you want then given a
number of strings read from some input store them in a std::vector and
use std::sort() on them. Don't know the exact ordering of strings but
I'd guess that capital letters are sorted before lowercase letters so
the most likely result would be:

ABC
abc
BBC

*All* capital letters come before *any* lowercase ones. So, the result
*should* be

ABC
BBC
abc

V
--
Please remove capital 'A's when replying by e-mail
I do not respond to top-posted replies, please don't ask- Hide quoted text -

- Show quoted text -

but I want in that way only can you tell me how ,that sort function
will not give this result.

[Victor Bazarov]

ap************* *@gmail.com wrote:

On Apr 19, 6:42 pm, "Victor Bazarov" <v.Abaza...@com Acast.netwrote:

>Erik Wikström wrote:

>>On 19 Apr, 13:50, aparnakakkar2.. [e-mail] wrote:
can any one tell me if I give the followiing string in input:
ABC
abc
BBC

>>>then how I can get
ABC
abc
BBC

>>>or

>>>abc
ABC
BBC
as my output usiing quicksort.

>>Don't know about quicksort but if it's sorting you want then given a
number of strings read from some input store them in a std::vector
and use std::sort() on them. Don't know the exact ordering of
strings but I'd guess that capital letters are sorted before
lowercase letters so the most likely result would be:

>>ABC
abc
BBC

*All* capital letters come before *any* lowercase ones. So, the
result
*should* be

ABC
BBC
abc

V
--
Please remove capital 'A's when replying by e-mail
I do not respond to top-posted replies, please don't ask- Hide
quoted text -

- Show quoted text -

but I want in that way only can you tell me how ,that sort function
will not give this result.

Well, I wasn't replying to you, I was replyting to Erik.

And, sorry, I don't understand the last sentence you posted. Could
you perhaps rephrase it using a few shorter sentences?

Neither C++ strings (objects of type 'std::string') nor C strings
(arrays of char) can be sorted using 'quicksort' (generally speaking).

To sort 'std::string' objects, use 'std::sort' (which most likely
implements Quick Sort algorithm), or the 'sort' member of the 'list'
container (if your strings are in a 'list' container).

In order to use 'qsort' function, you'd have to define your own
data structures, your own comparator, and then place your data in
an array, and then call 'qsort'. If that's your how you want to do
that, fine; it's not the best C++ way, however.

V
--
Please remove capital 'A's when replying by e-mail
I do not respond to top-posted replies, please don't ask

[Jim Langston]

<ap************ **@gmail.comwro te in message
news:11******** *************@p 77g2000hsh.goog legroups.com...

can any one tell me if I give the followiing string in input:
ABC
abc
BBC

then how I can get
ABC
abc
BBC
or

abc
ABC
BBC
as my output usiing quicksort.

Well, this doesn't use quicksort but std::sort which is O( N log N ).

Output is:

Before sort:
ABC
abc
BBC
ABCD
aB

After sort:
ABC
ABCD
BBC
aB
abc

After Case Insensitive sort:
aB
ABC
abc
ABCD
BBC

There may be a better/faster algorithm for the case insensitve comparing of
std::strings. I just did this one rather quickly.

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

bool CILessthan( const std::string Elem1, const std::string Elem2 )
{
for ( std::size_t i = 0; i < Elem1.length(); ++i )
{
if ( std::tolower( Elem1[i] ) < std::tolower( Elem2[i] ) )
return true;
else if ( std::tolower( Elem1[i] ) std::tolower( Elem2[i] ) )
return false;
}

// Equal up to this point, but one may be longer
if ( Elem1.length() < Elem2.length() )
return true;

return false;
}

void ShowData( const std::vector<std ::string>& Data )
{
for ( std::vector<std ::string>::cons t_iterator it = Data.begin(); it !=
Data.end(); ++it )
std::cout << (*it) << "\n";
}

int main()
{
std::vector<std ::stringData;
Data.push_back( "ABC" );
Data.push_back( "abc" );
Data.push_back( "BBC" );
Data.push_back( "ABCD" );
Data.push_back( "aB" );

std::cout << "Before sort:\n";
ShowData( Data );

std::sort( Data.begin(), Data.end() );
std::cout << "\nAfter sort:\n";
ShowData( Data );

std::sort( Data.begin(), Data.end(), CILessthan );
std::cout << "\nAfter Case Insensitive sort:\n";
ShowData( Data );

std::string wait;
std::getline( std::cin, wait );
}

[aparnakakkar2003]

On Apr 19, 8:20 pm, "Jim Langston" <tazmas...@rock etmail.comwrote :

<aparnakakkar2. [e-mail] te in message

news:11******** *************@p 77g2000hsh.goog legroups.com...

can any one tell me if I give the followiing string in input:
ABC
abc
BBC

then how I can get
ABC
abc
BBC

or

abc
ABC
BBC
as my output usiing quicksort.

Well, this doesn't use quicksort but std::sort which is O( N log N ).

Output is:

Before sort:
ABC
abc
BBC
ABCD
aB

After sort:
ABC
ABCD
BBC
aB
abc

After Case Insensitive sort:
aB
ABC
abc
ABCD
BBC

There may be a better/faster algorithm for the case insensitve comparing of
std::strings. I just did this one rather quickly.

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

bool CILessthan( const std::string Elem1, const std::string Elem2 )
{
for ( std::size_t i = 0; i < Elem1.length(); ++i )
{
if ( std::tolower( Elem1[i] ) < std::tolower( Elem2[i] ) )
return true;
else if ( std::tolower( Elem1[i] ) std::tolower( Elem2[i] ) )
return false;
}

// Equal up to this point, but one may be longer
if ( Elem1.length() < Elem2.length() )
return true;

return false;

}

void ShowData( const std::vector<std ::string>& Data )
{
for ( std::vector<std ::string>::cons t_iterator it = Data.begin(); it !=
Data.end(); ++it )
std::cout << (*it) << "\n";

}

int main()
{
std::vector<std ::stringData;
Data.push_back( "ABC" );
Data.push_back( "abc" );
Data.push_back( "BBC" );
Data.push_back( "ABCD" );
Data.push_back( "aB" );

std::cout << "Before sort:\n";
ShowData( Data );

std::sort( Data.begin(), Data.end() );
std::cout << "\nAfter sort:\n";
ShowData( Data );

std::sort( Data.begin(), Data.end(), CILessthan );
std::cout << "\nAfter Case Insensitive sort:\n";
ShowData( Data );

std::string wait;
std::getline( std::cin, wait );

}- Hide quoted text -

- Show quoted text -- Hide quoted text -

- Show quoted text -

please tell me how is it possible with (std::list<std: :stringdata)
as an argument

[Jim Langston]

<ap************ **@gmail.comwro te in message
news:11******** **************@ n76g2000hsh.goo glegroups.com.. .

On Apr 19, 8:20 pm, "Jim Langston" <tazmas...@rock etmail.comwrote :

><aparnakakkar2 [e-mail] ote in message

news:11******* **************@ p77g2000hsh.goo glegroups.com.. .

can any one tell me if I give the followiing string in input:
ABC
abc
BBC

then how I can get
ABC
abc
BBC

or

abc
ABC
BBC
as my output usiing quicksort.

Well, this doesn't use quicksort but std::sort which is O( N log N ).

Output is:

Before sort:
ABC
abc
BBC
ABCD
aB

After sort:
ABC
ABCD
BBC
aB
abc

After Case Insensitive sort:
aB
ABC
abc
ABCD
BBC

There may be a better/faster algorithm for the case insensitve comparing
of
std::strings . I just did this one rather quickly.

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

bool CILessthan( const std::string Elem1, const std::string Elem2 )
{
for ( std::size_t i = 0; i < Elem1.length(); ++i )
{
if ( std::tolower( Elem1[i] ) < std::tolower( Elem2[i] ) )
return true;
else if ( std::tolower( Elem1[i] ) std::tolower( Elem2[i] ) )
return false;
}

// Equal up to this point, but one may be longer
if ( Elem1.length() < Elem2.length() )
return true;

return false;

}

void ShowData( const std::vector<std ::string>& Data )
{
for ( std::vector<std ::string>::cons t_iterator it = Data.begin(); it
!=
Data.end(); ++it )
std::cout << (*it) << "\n";

}

int main()
{
std::vector<std ::stringData;
Data.push_back( "ABC" );
Data.push_back( "abc" );
Data.push_back( "BBC" );
Data.push_back( "ABCD" );
Data.push_back( "aB" );

std::cout << "Before sort:\n";
ShowData( Data );

std::sort( Data.begin(), Data.end() );
std::cout << "\nAfter sort:\n";
ShowData( Data );

std::sort( Data.begin(), Data.end(), CILessthan );
std::cout << "\nAfter Case Insensitive sort:\n";
ShowData( Data );

std::string wait;
std::getline( std::cin, wait );

}- Hide quoted text -

- Show quoted text -- Hide quoted text -

- Show quoted text -

please tell me how is it possible with (std::list<std: :stringdata)
as an argument

Just replace
std::sort( Data.begin(), Data.end(); CILessthan );
with
Data.sort( CILessthan );

As long as it's a list and not a vector.

[James Kanze]

On Apr 19, 3:42 pm, "Victor Bazarov" <v.Abaza...@com Acast.netwrote:

Erik Wikström wrote:

On 19 Apr, 13:50, aparnakakkar2.. [e-mail] wrote:

can any one tell me if I give the followiing string in input:
ABC
abc
BBC

then how I can get
ABC
abc
BBC

or

abc
ABC
BBC
as my output usiing quicksort.

Don't know about quicksort but if it's sorting you want then given a
number of strings read from some input store them in a std::vector and
use std::sort() on them. Don't know the exact ordering of strings but
I'd guess that capital letters are sorted before lowercase letters so
the most likely result would be:

ABC
abc
BBC

*All* capital letters come before *any* lowercase ones.

That's actually platform dependant (and so off-topic here:-).
On an IBM mainframe, capital letters come after lowercase (and
there are some punctuation signs which show up in the middle of
the alphabet). On my system (Solaris), some of the capitals
even have negative values---forcing them to an unsigned char
results in two blocks of capitals, and two of small letters,
interleaved (with some punctuation and some control characters
between them).

That's why when the order is significant to a human being,
you'll almost always use a locale specific collating function.

--
James Kanze (GABI Software) email:ja******* **@gmail.com
Conseils en informatique orientée objet/
Beratung in objektorientier ter Datenverarbeitu ng
9 place Sémard, 78210 St.-Cyr-l'École, France, [phone]

[aparnakakkar2003]

On Apr 19, 10:21 pm, James Kanze <james.ka...@gm ail.comwrote:

On Apr 19, 3:42 pm, "Victor Bazarov" <v.Abaza...@com Acast.netwrote:

Erik Wikström wrote:

On 19 Apr, 13:50, aparnakakkar2.. [e-mail] wrote:
>can any one tell me if I give the followiing string in input:
>ABC
>abc
>BBC
>then how I can get
>ABC
>abc
>BBC
>or
>abc
>ABC
>BBC
>as my output usiing quicksort.
Don't know about quicksort but if it's sorting you want then given a
number of strings read from some input store them in a std::vector and
use std::sort() on them. Don't know the exact ordering of strings but
I'd guess that capital letters are sorted before lowercase letters so
the most likely result would be:
ABC
abc
BBC

*All* capital letters come before *any* lowercase ones.

That's actually platform dependant (and so off-topic here:-).
On an IBM mainframe, capital letters come after lowercase (and
there are some punctuation signs which show up in the middle of
the alphabet). On my system (Solaris), some of the capitals
even have negative values---forcing them to an unsigned char
results in two blocks of capitals, and two of small letters,
interleaved (with some punctuation and some control characters
between them).

That's why when the order is significant to a human being,
you'll almost always use a locale specific collating function.

--
James Kanze (GABI Software) email:james.ka. [e-mail]
Conseils en informatique orientée objet/
Beratung in objektorientier ter Datenverarbeitu ng
9 place Sémard, 78210 St.-Cyr-l'École, France, [phone]- Hide quoted text -

- Show quoted text -

can any one tell me i f the code below will work or not

void QuickSortList(V R_STRINGList::i terator
pLeft,VR_STRING List::iterator pRight)
{
VR_STRINGList ::iterator pStart;
VR_STRINGList ::iterator pCurrent;
// VR_STRINGList ::iterator nCopyInteger; // If the left and
right pointers are the same, then return

VR_STRING nCopyInteger;

if (pLeft == pRight)
return;

pStart = pLeft;
pCurrent = pStart++; // Loop forever (well until we get to the
right)
while (1)
{
if(strcmpi(pSta rt->c_str(),pCurre nt->c_str())<0)
{
nCopyInteger = *pCurrent;
*pCurrent = *pStart;
*pStart = nCopyInteger;
}
if (pCurrent == pRight)
break;
pCurrent = pCurrent++;
}

nCopyInteger = *pLeft;
*pLeft = *pCurrent;
*pCurrent= nCopyInteger;

VR_STRINGList ::iterator pOldCurrent;
*pOldCurrent = *pCurrent;
pCurrent = pCurrent--;

if (pCurrent != NULL)
{
if ((pLeft-- != pCurrent) && (pCurrent++ != pLeft))
QuickSortList(p Left,pCurrent);
}

pCurrent = pOldCurrent;
pCurrent = pCurrent++;
if (pCurrent != NULL)
{
if ((pCurrent-- != pRight) && (pRight++ != pCurrent))
QuickSortList(p Current, pRight);
}
}
Tell me problem please I am not getting the output.