Easy, Short ✅✅ | 2 Approach🔥 | Bit Manipulation | Recursion | Bitwise Add
Complexity\n- Time complexity: O(N)\n Add your time complexity here, e.g. O(n) \n\n- Space complexity: O(1)\n Add your space complexity here, e.g. O(n) \n\n# Co
# Complexity\n- Time complexity: O(N)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: O(1)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code: Bitwise Add using Recursion \n```\nclass Solution {\npublic:\n    int getSum(int a, int b) {\n        if(b==0) return a;\n        else{\n            return getSum(a^b, (unsigned int)(a&b)<<1);\n        }\n    }\n};\n```\n\n# Code: Bitwise Add\n```\nclass Solution {\npublic:\n    int getSum(int a, int b) {\n        int carry;\n        while (b!=0){\n            carry = a&b;\n            a = a^b;\n            b = (unsigned int)carry<<1;\n        }\n        return a;\n    }\n};\n```
['Math', 'Bit Manipulation', 'Recursion', 'C++']