Given a string, write a function that converts it either from lower to upper case or from upper to lower case using the bitwise operators &(AND), |(OR), ~(NOT) in place and returns the string. Many of us know that Bitwise manipulations are faster than performing arithmetic operations for a compiler as the data is stored in binary form 0’s and 1’s. Examples:
Input : "LowerToUpPer"
Output : "LOWERTOUPPER"
Letters already in the uppercase remains the same.
while rest get converted to uppercase.
Input : "UPPerTOloweR"
Output : "uppertolower"
Letters already in the lowercase remains the same.
while rest get converted to lowercase.
1.Lower to Upper Case This method simply subtracts a value of 32 from the ASCII value of lowercase letter by Bitwise ANDing (&) with negation (~) of 32 converting the letter to uppercase.
Implementation:
CPP
#include<stdio.h>
const int x = 32;
char *toUpperCase( char *a)
{
for ( int i=0; a[i]!= '\0' ; i++)
a[i] = a[i] & ~x;
return a;
}
int main()
{
char str[] = "SanjaYKannA" ;
printf ( "%s" , toUpperCase(str));
return 0;
}
|
Time complexity : O(n)
Auxiliary Space : O(1)
2.Upper to Lower Case Similarly, it adds a value of 32 to the ASCII value of uppercase letter by Bitwise ORing (|) with 32 converting the letter to lowercase.
Implementation:
CPP
#include<stdio.h>
const int x = 32;
char * toLowerCase( char *a)
{
for ( int i=0; a[i]!= '\0' ; i++)
a[i] = a[i] | x;
return a;
}
int main()
{
char str[] = "SanjaYKannA" ;
printf ( "%s" , toLowerCase(str));
return 0;
}
|
Time complexity : O(n)
Auxiliary Space : O(1)
Explanation: The ASCII table is constructed in such way that the binary representation of lowercase letters is almost identical of binary representation of uppercase letters. Character ‘A’ is integer 65 = (0100 0001)2, while character ‘a’ is integer 97 = (0110 0001)2. The difference between the ASCII values of ‘a’ and ‘A’ is 32. So we can easily change the case of the letters either from Upper to lower or lower to upper by adding or subtracting the difference from the letters using bitwise operators as shown above.
Exercise: Implement a function that change the case of a string such that GeeksFoRgeekS turns gEEKSfOrGEEKs .
If you like GeeksforGeeks and would like to contribute, you can also write an article using write.geeksforgeeks.org or mail your article to review-team@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Feeling lost in the world of random DSA topics, wasting time without progress? It's time for a change! Join our DSA course, where we'll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 geeks!