This approach imitates the addition mechanism in digital circuits using bitwise operations. The key operations involved are:
Time Complexity: O(n), where n is the number of bits needed to represent the numbers.
Space Complexity: O(1), constant space usage.
1using System;
2
3class Program {
4 static int GetSum(int a, int b) {
5 while (b != 0) {
6 int carry = a & b;
7 a = a ^ b;
8 b = carry << 1;
9 }
10 return a;
11 }
12
13 static void Main() {
14 Console.WriteLine(GetSum(2, 3));
15 }
16}The C# implementation also uses a loop to calculate the carry and interim sums until the carry is zero. This process relies on essential bitwise operations to replace the '+' operator.
This approach is an extension of the iterative bitwise method but uses recursive calls to achieve the result. Instead of using a loop, it relies on recursive function calls to process the sum and carry until the carry becomes zero.
Time Complexity: O(n), where n is the number of bits.
Space Complexity: O(n), due to the recursive call stack.
1public class Main {
2 public static int getSum(int a, int b) {
3 if (b == 0) return a;
4 int sum = a ^ b;
5 int carry = (a & b) << 1;
6 return getSum(sum, carry);
7 }
8
9 public static void main(String[] args) {
10 System.out.println(getSum(1, 2));
11 }
12}The Java recursive implementation follows the pattern of calculating sum and carry and uses recursive method calls, returning the result when carry is zero.