Even Odd

Even odd is a project where we intend to find maximum possible way to check whether a number is even or odd. The main objectives of the program is;

• To demonstrate that there is not just a highway in programming, there are many ways and it depends on your problem solving ability,
• To share each other approach to a simple solution,
• To know to what extent can we do for this task..

How to contribute?

1. Fork the project,
2. Read the README.md file which consists what approach we have taken so far. Such that, your solution would be unique.
3. You can code in any language, but be sure to keep your code in the respective directory for your programming language. If you don't find yours, you can create one.
4. Code, and create a pull request.
5. And yeah, don't forget to write what you have done in Our approaches section in README.md file, and mention yourself in Our contributors section.

Our contributors

• Niyoj Oli @niyoj
• Om Prakash Sharma @ompiepy
• Khemraj Shrestha @Khemraj-bit
• Ajay Ratnam @ajratnam
• You too can be here.

Our approaches

• We used simple modulus operator to check whether a number is perfectly divisible by 2 or not in modulus.c.
• We used bitwise and operator & as even number always ends with 0 and odd with 1 and using & operator if it is odd output is non-zero (true) else output is zero (false) in bitwise_and.c.
• We used looping from 1 to n times and in each loop either we add any variable by 1 or subtract it by 1. First it is added, and in second it is decremented and this loop continues. Hence, +1 and -1 is repeated even times for even number so, for even output is 0 (true) and for odd it is non-zero (false) in loop_1.c.
• We used concept of integer division i.e. when two integers are divided the value is also converted to integer type. So, even number divided by 2 followed by multiplication 2 is same as the initial number, but in case of odd number divided by 2 the value consists of decimal part which is removed during integer conversion, so when it is multiplied by 2, it is not same as initial number in int_divison.c
• We used concept that when (-1) is raised to power of even number, its value is 1, But, for even number is -1. So, using this concept we checked whether a number is even or odd in cubic.c.
• We used concept that even numbers end with 0 in binary and odd numbers end with 1 in binary form in shift.c.
• We used concept that when a number is operated with 1 by bitwise XOR operator (^) the bit of the last digit is off by 1, and on adding 1 to the original number returns the originality for even numbers, not in case for odd numbers. So, using this concept we checked whether the number is even or odd in bitwise_xor.c.
• We used concept that an even number is made from addition of n/2 number of 2. So, we subtracted the number by 2 continuously until the number was less than or equal to zero. Since, even numbers were made from addition of 2 for (n/2) times, the output was 0, but in case of odd numbers the output was 1 or -1. So, using this concept we checked whether the number is even or odd in loop_2.c.
• We used the same concept of using modulus operator as that in modulus.c but the difference is only that for conditional flow of control we used if-else statement in modulus.c while we used ternary operator in ternary.c.
• We used concept that the lcm of 2 and an even number is itself, But for an odd number it is not. So, using this concept we checked whether a number is even or odd in lcm.py.