Given a string, write a function that returns toggle case of a string using the bitwise operators in place.
In ASCII codes, character ‘A’ is integer 65 = (0100 0001)2, while character ‘a’ is integer 97 = (0110 0001)2. Similarly, character ‘D’ is integer 68 = (0100 0100)2, while character ‘d’ is integer 100 = (0110 0100)2.
As we can see, only sixth least significant bit is different in ASCII code of ‘A’ and ‘a’. Similar behavior can be seen in ASCII code of ‘D’ and ‘d’. Therefore, we need to toggle this bit for toggling case.
Examples:
Input : "GeekSfOrgEEKs" Output : "gEEKsFoRGeekS" Input : "StRinG" Output : "sTrINg"
The ASCII table is constructed in such way that the binary representation of lowercase letters is almost identical of binary representation of uppercase letters.
Toggling Case:
The integer with 6th LSB as 1 is 32 (0010 0000). Therefore, bitwise XORing of a character with 32 will toggle the 6th LSB of character and hence, will toggle its case. If character is upper case, it will be converted to lower case and vice versa.
Implementation:
C++
#include <bits/stdc++.h>
using namespace std;
char *toggleCase(char *a)
{
for(int i = 0; a[i] != '\0'; i++)
{
a[i] ^= 32;
}
return a;
}
int main()
{
char str[] = "CheRrY";
cout << "Toggle case: "
<< toggleCase(str) << endl;
cout << "Original string: "
<< toggleCase(str) << endl;
return 0;
}
|
C
#include <stdio.h>
char *toggleCase(char *a)
{
for (int i=0; a[i]!='\0'; i++) {
a[i] ^= 32;
}
return a;
}
int main()
{
char str[] = "CheRrY";
printf("Toggle case: %s\n", toggleCase(str));
printf("Original string: %s", toggleCase(str));
return 0;
}
|
Java
public class Test
{
static int x=32;
static String toggleCase(char[] a)
{
for (int i=0; i<a.length; i++) {
a[i]^=32;
}
return new String(a);
}
&n
bsp;
public static void main(String[] args)
{
String str = "CheRrY";
System.out.print("Toggle case: ");
str = toggleCase(str.toCharArray());
System.out.println(str);
System.out.print("Original string: ");
str = toggleCase(str.toCharArray());
System.out.println(str);
}
}
|
Python3
x = 32;
def toggleCase(a):
for i in range(len(a)):
a = a[:i] + chr(ord(a[i]) ^ 32) + a[i + 1:];
return a;
str = "CheRrY";
print("Toggle case: ", end = "");
str = toggleCase(str);
print(str);
print("Original string: ", end = "");
str = toggleCase(str);
print(str);
|
C#
using System;
class GFG {
static string toggleCase(char []a)
{
for (int i = 0; i < a.Length; i++)
{
a[i] ^= (char)32;
}
return new string(a);
}
public static void Main()
{
string str = "CheRrY";
Console.Write("Toggle case: ");
str = toggleCase(str.ToCharArray());
Console.WriteLine(str);
Console.Write("Original string: ");
str = toggleCase(str.ToCharArray());
Console.Write(str);
}
}
|
Javascript
<script>
x = 32;
function toggleCase(a)
{
for (i = 0; i < a.length; i++)
{
&n
bsp;
a[i] = String.fromCharCode(a[i].charCodeAt(0)^32);
}
return a.join("");;
}
var str = "CheRrY";
document.write("Toggle case: ");
str = toggleCase(str.split(''));
document.write(str);
document.write("<br>Original string: ");
str = toggleCase(str.split(''));
document.write(str);
</script>
|
Output
Toggle case: cHErRy Original string: CheRrY
Time complexity: O(n) since one traversal of the string is required to complete all operations hence the overall time required by the algorithm is linear
Auxiliary Space: O(1) since no extra array is used so the space taken by the algorithm is constant
Thanks to Kumar Gaurav for improving the solution.
Similar Article :
Case conversion of a string using BitWise operators in C/C++
This article is contributed by Sanjay Kumar Ulsha from JNTUH College Of Engineering, Hyderabad. If you like GeeksforGeeks and would like to contribute, you can also write an article using write.geeksforgeeks.org or mail your article to [email protected]. See your article appearing on the GeeksforGeeks main page and help other Geeks.