added bit-based algorithms (#470)

Author: MysticAdi

Diff for: Bit Algorithms/Rotate Bits/C++/rotate_bits.cpp

@@ -0,0 +1,31 @@
+ //Do Left and Right rotate given the number n and the shift-by value d
+ //Number is n
+ //The number of bits by which n should be rotated is given by d
+ //Both rotate right and rotate left is provided
+ //32 bit frame is taken
+
+#include<iostream>
+#include<algorithm>
+using namespace std;
+#define MAX 32
+int bit_rright(int n, int l)
+{
+	int a = n<<(MAX-l);
+	int b = n>>l;
+	return (a|b);
+}
+int bit_rleft(int n , int l)
+{
+	int a = n<<l;
+	int b = n>>(MAX-l);
+	return (a|b);
+}
+
+int main()
+{
+	int n,d;
+	cin>>n>>d;
+	int x=bit_rright(n,d);
+	int y = bit_rleft(n,d);
+	cout<<x<<" "<<y<<endl;
+}

Diff for: Bit Algorithms/Toggle Bits/C++/toggle_bits.cpp

@@ -0,0 +1,31 @@
+ //Given range l and r for the number n, toggle bits within the range
+// n = 50 -> 110010
+// l = 2
+// r = 5
+// Result -> 101100 = 44
+
+#include<iostream>
+#include<algorithm>
+using namespace std;
+
+int toggle(int n , int l , int r)
+{
+	int c=0;
+	int b=1;			//For a new num, set bits between l to r
+	b = b<<(l-1);
+	for(int i=0;i<r-l+1;i++)
+	{
+		c = c|b;
+		b = b<<1;
+	}
+	int x = c^n;		//XOR with the original number to reverse the bits
+	return x;
+}
+
+int main()
+{
+	int n,l,r;
+	cin>>n>>l>>r;
+	int x = toggle(n,l,r);
+	cout<<x<<endl;
+}