check if a number is odd or even bitwise

Author: ZapDos7

README.md

@@ -53,6 +53,8 @@
 - [x] Hamming Weight implementation (return 1-bits of a binary representation of a number)
 - [x] [Binary to Decimal Converter](https://tausiq.wordpress.com/2009/07/27/uab-2005-problem-3-binary-to-decimal-converter/)
 - [x] [Reverse bits](https://leetcode.com/problems/reverse-bits/)
+- [x] [Bit Hacks — Part 1 (Basic)](http://www.techiedelight.com/bit-hacks-part-1-basic/)
+
 
 ## Algorithms
 
@@ -170,7 +172,6 @@
 ## To Do
 
 - Bits Manipulation
-    - [ ] [Bit Hacks — Part 1 (Basic)](http://www.techiedelight.com/bit-hacks-part-1-basic/)
     - [ ] [Bit Hacks — Part 2 (Playing with k’th bit)](http://www.techiedelight.com/bit-hacks-part-2-playing-kth-bit/)
     - [ ] [Bit Hacks — Part 3 (Playing with rightmost set bit of a number)](http://www.techiedelight.com/bit-hacks-part-3-playing-rightmost-set-bit-number/)
     - [ ] [Bit Hacks — Part 4 (Playing with letters of English alphabet)](http://www.techiedelight.com/bit-hacks-part-4-playing-letters-english-alphabet/)

src/binary/binCheckOddOrEven/BinaryCheckOddEvenNum.java

@@ -0,0 +1,17 @@
+package binary.binCheckOddOrEven;
+
+import utils.InputReader;
+
+// The expression n & 1 returns value 1 or 0 depending upon whether n is odd or even.
+public class BinaryCheckOddEvenNum {
+    public static void main(String[] args) {
+        System.out.print("Input a number: ");
+        int n = InputReader.readInt();
+        if ((n & 1) != 0) {
+            System.out.println(n + " is odd");
+        }
+        else {
+            System.out.println(n + " is even");
+        }
+    }
+}