?
Solved

Using String ToUpper, Sorting an Array of string without CaseSensitive

Posted on 2003-10-23
7
Medium Priority
?
580 Views
Last Modified: 2010-04-01
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
Comment
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
  • Learn & ask questions
  • 4
7 Comments
 

Author Comment

by:sly_06
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

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

Author Comment

by:sly_06
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
What does it mean to be "Always On"?

Is your cloud always on? With an Always On cloud you won't have to worry about downtime for maintenance or software application code updates, ensuring that your bottom line isn't affected.

 

Author Comment

by:sly_06
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

by:DanRollins
ID: 9608843
0
 

Accepted Solution

by:
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

VIDEO: THE CONCERTO CLOUD FOR HEALTHCARE

Modern healthcare requires a modern cloud. View this brief video to understand how the Concerto Cloud for Healthcare can help your organization.

Question has a verified solution.

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

Often, when implementing a feature, you won't know how certain events should be handled at the point where they occur and you'd rather defer to the user of your function or class. For example, a XML parser will extract a tag from the source code, wh…
C++ Properties One feature missing from standard C++ that you will find in many other Object Oriented Programming languages is something called a Property (http://www.experts-exchange.com/Programming/Languages/CPP/A_3912-Object-Properties-in-C.ht…
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 be introduced to the member functions push_back and pop_back of the vector class. The video will teach the difference between the two as well as how to use each one along with its functionality.
Suggested Courses

762 members asked questions and received personalized solutions in the past 7 days.

Join the community of 500,000 technology professionals and ask your questions.

Join & Ask a Question