C-Sharp | Java | Python | Swift | GO | WPF | Ruby | Scala | F# | JavaScript | SQL | PHP | Angular | HTML
And: If the remainder not 0, then the number must be odd—the remainder would be 0 if it was divisible by 2.
C# program that finds odd numbers
using System;
class Program
{
static void Main()
{
for (int i = 0; i <= 100; i++)
{
if (IsOdd(i))
{
Console.WriteLine(i);
}
}
}
public static bool IsOdd(int value)
{
return value % 2 != 0;
}
}
Output
1
3
5
7
9
11
13
15
17
19
21
23
25
27
29
31
33
35
37
39
41
43
45
47
49
51
53
55
57
59
61
63
65
67
69
71
73
75
77
79
81
83
85
87
89
91
93
95
97
99
So: If there is no remainder (it returns zero) then the number is definitely even.
Inlined: This method could be inlined into the locations you call it without too much loss of clarity.
Zero: To learn more about the parity of zero, check out Wikipedia. Zero is an even number.
Parity of zero: WikipediaC# program that finds even numbers
using System;
class Program
{
static void Main()
{
for (int i = 0; i <= 100; i++)
{
if (IsEven(i))
{
Console.WriteLine(i);
}
}
}
public static bool IsEven(int value)
{
return value % 2 == 0;
}
}
Output
0
2
4
6
8
10
12
14
16
18
20
22
24
26
28
30
32
34
36
38
40
42
44
46
48
50
52
54
56
58
60
62
64
66
68
70
72
74
76
78
80
82
84
86
88
90
92
94
96
98
100
Correction: There was something odd about the first implementation of IsOdd on this page. It did not handle negative numbers correctly.
And: Fortunately, Joshua Goodman wrote in with the bug report and I corrected the problem.