Add Full Adder algorithm (math/bits) #334
Merged
+123
−0
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Full Adder
This method adds up two integer numbers using bitwise operators.
It implements full adder electronics circut logic to sum two 32-bit integers in two's complement format. It's using the boolean logic to cover all possible cases of adding two input bits: with and without a "carry bit" from adding the previous less-significant stage.
Legend:
A
: NumberA
B
: NumberB
ai
: ith bit of numberA
bi
: ith bit of numberB
carryIn
: a bit carried in from the previous less-significant stagecarryOut
: a bit to carry to the next most-significant stagebitSum
: The sum ofai
,bi
, andcarryIn
resultBin
: The full result of adding current stage with all less-significant stages (in binary)resultBin
: The full result of adding current stage with all less-significant stages (in decimal)