Want to win a PS4? Go Premium and enter to win our High-Tech Treats giveaway. Enter to Win

x
?
Solved

Using String ToUpper, Sorting an Array of string without CaseSensitive

Posted on 2003-10-23
7
Medium Priority
?
583 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
Concerto Cloud for Software Providers & ISVs

Can Concerto Cloud Services help you focus on evolving your application offerings, while delivering the best cloud experience to your customers? From DevOps to revenue models and customer support, the answer is yes!

Learn how Concerto can help you.

 

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

Technology Partners: We Want Your Opinion!

We value your feedback.

Take our survey and automatically be enter to win anyone of the following:
Yeti Cooler, Amazon eGift Card, and Movie eGift Card!

Question has a verified solution.

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

Written by John Humphreys C++ Threading and the POSIX Library This article will cover the basic information that you need to know in order to make use of the POSIX threading library available for C and C++ on UNIX and most Linux systems.   [s…
This article will show you some of the more useful Standard Template Library (STL) algorithms through the use of working examples.  You will learn about how these algorithms fit into the STL architecture, how they work with STL containers, and why t…
The viewer will learn how to pass data into a function in C++. This is one step further in using functions. Instead of only printing text onto the console, the function will be able to perform calculations with argumentents given by the user.
The viewer will learn how to user default arguments when defining functions. This method of defining functions will be contrasted with the non-default-argument of defining functions.
Suggested Courses

610 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