Solved

# Using String ToUpper, Sorting an Array of string without CaseSensitive

Posted on 2003-10-23
575 Views
I need to sort an array of string where I don't want the Capitals to be smaller then the normal case.

Example A = a

I guess using ToUpper will help me but I can't get it to work.
Or maybe there is another way to do it .

Thank you
0
Question by:sly_06
[X]
###### Welcome to Experts Exchange

Add your voice to the tech community where 5M+ people just like you are talking about what matters.

• Help others & share knowledge
• Earn cash & points
• 4

Author Comment

ID: 9606998
Here is what I got so far ,
It display the list not even in Order

void Sort(string LIST[],string TYPE[],int n)
{

string tmp;

char TEMP[2000][200];
string TEMP2[2000];
for (int i = 0 ; i < n ; i++)
{
strcpy(TEMP[i],LIST[i].c_str());
int j = 0;
do
{
if(TEMP[i][j] >= 97 && TEMP[i][j] <= 122 )
TEMP[i][j] -= 32;
j++;
}while(TEMP[i][j]!=0);
TEMP2[i] = TEMP[i];
}

for (int i = 0 ; i < n ; i++)

//This is for Debugging Purposes
cout << TEMP2[i] << " " << TEMP[i]<< LIST[i] << endl;

for (int i=0; i<n-1; i++) {
for (int j=0; j<n-1-i; j++){
//this is to be able to find repeated words since , I dont want repetition
if (LIST[j+1] == LIST[j]){
LIST[j] = "";
TYPE[j] = "";
}//End of IF
else if (TEMP2[j+1] < TEMP2[j]) {  /* compare the two neighbors */
tmp = LIST[j];           /* swap a[j] and a[j+1]      */
LIST[j] = LIST[j+1];
LIST[j+1] = tmp;
tmp = TYPE[j];           /* swap a[j] and a[j+1]      */
TYPE[j] = TYPE[j+1];
TYPE[j+1] = tmp;
}//End Of ElseIF
}//End of Inner For Loop
}//End of Outer For Loop

}//End Of Sort Function
0

LVL 2

Expert Comment

ID: 9607378
Do you need to preserve the original capitalization after sorting and do you need to remove duplicates?
0

Author Comment

ID: 9607465
yes, well I created 2 function, void SORT and void SORTWITHOUTREMOVE

and I need to keep the original Case after , this is why Im doing the check on the TEMP2 but affecting the actual LIST.

0

Author Comment

ID: 9608237
Ok I found the problem , I was doing the check on TEMP2 but  I wasnt  swapping in TEMP2.

Is there a way to remove my question ?

SInce I got the aswer (for the points).
0

LVL 49

Expert Comment

ID: 9608843
0

Accepted Solution

sly_06 earned 0 total points
ID: 9610717
void Sort(string LIST[],string TYPE[],int n)
{

string tmp;

char TEMP[2000][200];
string TEMP2[2000];
for (int i = 0 ; i < n ; i++)
{
strcpy(TEMP[i],LIST[i].c_str());
int j = 0;
do
{
if(TEMP[i][j] >= 97 && TEMP[i][j] <= 122 )
TEMP[i][j] -= 32;
j++;
}while(TEMP[i][j]!=0);
TEMP2[i] = TEMP[i];
}

for (int i=0; i<n-1; i++) {
for (int j=0; j<n-1-i; j++){
if (TEMP2[j+1] == TEMP2[j]){
//cout << "False" << endl;
LIST[j] = "";
TYPE[j] = "";
TEMP2[j] = "";

}//End of IF
else if (TEMP2[j+1] < TEMP2[j]) {  /* compare the two neighbors */
//cout << "True" << endl;
tmp = LIST[j];           /* swap a[j] and a[j+1]      */
LIST[j] = LIST[j+1];
LIST[j+1] = tmp;
tmp = TEMP2[j];           /* swap a[j] and a[j+1]      */
TEMP2[j] = TEMP2[j+1];
TEMP2[j+1] = tmp;
tmp = TYPE[j];           /* swap a[j] and a[j+1]      */
TYPE[j] = TYPE[j+1];
TYPE[j+1] = tmp;
}//End Of ElseIF
}//End of Inner For Loop
}//End of Outer For Loop

}//End Of Sort Function
0

## Featured Post

Question has a verified solution.

If you are experiencing a similar issue, please ask a related question

### Suggested Solutions

This article shows you how to optimize memory allocations in C++ using placement new. Applicable especially to usecases dealing with creation of large number of objects. A brief on problem: Lets take example problem for simplicity: - I have a Gâ€¦
Go is an acronym of golang, is a programming language developed Google in 2007. Go is a new language that is mostly in the C family, with significant input from Pascal/Modula/Oberon family. Hence Go arisen as low-level language with fast compilationâ€¦
The viewer will learn how to use the return statement in functions in C++. The video will also teach the user how to pass data to a function and have the function return data back for further processing.
The viewer will learn additional member functions of the vector class. Specifically, the capacity and swap member functions will be introduced.
###### Suggested Courses
Course of the Month7 days, 20 hours left to enroll