Binary addition which disapproves carrying
I'm currently working with binary addition which returns False if there is carrying. My current code is :
def binaryadd(one, other):
str_1, str_2 = str(one), str(other)
for a,b in zip(str_1[::-1], str_2[::-1]):
if a == b == '1':
return False
return int(bin(rev_bin(one) + rev_bin(other))[2:])
so 10111 + 1000 would return 11111, 10110 + 1011 would return False. I think there would be more efficient codes ;such as to check overflows in addition, but I'm wondering which code could do it. Is there any better way to do it?
python binary addition
asked Nov 11 at 15:33
ILoveG11
325
add a comment |
I'm currently working with binary addition which returns False if there is carrying. My current code is :
def binaryadd(one, other):
str_1, str_2 = str(one), str(other)
for a,b in zip(str_1[::-1], str_2[::-1]):
if a == b == '1':
return False
return int(bin(rev_bin(one) + rev_bin(other))[2:])
so 10111 + 1000 would return 11111, 10110 + 1011 would return False. I think there would be more efficient codes ;such as to check overflows in addition, but I'm wondering which code could do it. Is there any better way to do it?
python binary addition
asked Nov 11 at 15:33
ILoveG11
325
add a comment |
I'm currently working with binary addition which returns False if there is carrying. My current code is :
def binaryadd(one, other):
str_1, str_2 = str(one), str(other)
for a,b in zip(str_1[::-1], str_2[::-1]):
if a == b == '1':
return False
return int(bin(rev_bin(one) + rev_bin(other))[2:])
so 10111 + 1000 would return 11111, 10110 + 1011 would return False. I think there would be more efficient codes ;such as to check overflows in addition, but I'm wondering which code could do it. Is there any better way to do it?
python binary addition
asked Nov 11 at 15:33
ILoveG11
325
I'm currently working with binary addition which returns False if there is carrying. My current code is :
def binaryadd(one, other):
str_1, str_2 = str(one), str(other)
for a,b in zip(str_1[::-1], str_2[::-1]):
if a == b == '1':
return False
return int(bin(rev_bin(one) + rev_bin(other))[2:])
so 10111 + 1000 would return 11111, 10110 + 1011 would return False. I think there would be more efficient codes ;such as to check overflows in addition, but I'm wondering which code could do it. Is there any better way to do it?
python binary addition
python binary addition
asked Nov 11 at 15:33
ILoveG11
325
asked Nov 11 at 15:33
ILoveG11
325
asked Nov 11 at 15:33
ILoveG11
325
asked Nov 11 at 15:33
ILoveG11
325
asked Nov 11 at 15:33
ILoveG11
325
325
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
There is carry from the moment there is a "column" for which both operands have a 1, since in that case we generate a carry. A carry can also propagate, but only if there was already a carry generated.
We can check this with a bitwise and (&). In case there is no carry, we can just is a bitwise or (|):
def binaryadd(one, other):
if one & other:
return False
return one | otheror in a one-liner:
def binaryadd(one, other):
return not bool(one & other) and one | otheranswered Nov 11 at 15:36
Willem Van Onsem
143k16135227
add a comment |
Your Answer
StackExchange.ifUsing("editor", function ()
StackExchange.using("externalEditor", function ()
StackExchange.using("snippets", function ()
StackExchange.snippets.init();
);
);
, "code-snippets");
StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "1"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);
else
createEditor();
);
function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);
);
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53250262%2fbinary-addition-which-disapproves-carrying%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
There is carry from the moment there is a "column" for which both operands have a 1, since in that case we generate a carry. A carry can also propagate, but only if there was already a carry generated.
We can check this with a bitwise and (&). In case there is no carry, we can just is a bitwise or (|):
def binaryadd(one, other):
if one & other:
return False
return one | otheror in a one-liner:
def binaryadd(one, other):
return not bool(one & other) and one | otheranswered Nov 11 at 15:36
Willem Van Onsem
143k16135227
add a comment |
There is carry from the moment there is a "column" for which both operands have a 1, since in that case we generate a carry. A carry can also propagate, but only if there was already a carry generated.
We can check this with a bitwise and (&). In case there is no carry, we can just is a bitwise or (|):
def binaryadd(one, other):
if one & other:
return False
return one | otheror in a one-liner:
def binaryadd(one, other):
return not bool(one & other) and one | otheranswered Nov 11 at 15:36
Willem Van Onsem
143k16135227
add a comment |
There is carry from the moment there is a "column" for which both operands have a 1, since in that case we generate a carry. A carry can also propagate, but only if there was already a carry generated.
We can check this with a bitwise and (&). In case there is no carry, we can just is a bitwise or (|):
def binaryadd(one, other):
if one & other:
return False
return one | otheror in a one-liner:
def binaryadd(one, other):
return not bool(one & other) and one | otheranswered Nov 11 at 15:36
Willem Van Onsem
143k16135227
There is carry from the moment there is a "column" for which both operands have a 1, since in that case we generate a carry. A carry can also propagate, but only if there was already a carry generated.
We can check this with a bitwise and (&). In case there is no carry, we can just is a bitwise or (|):
def binaryadd(one, other):
if one & other:
return False
return one | otheror in a one-liner:
def binaryadd(one, other):
return not bool(one & other) and one | otheranswered Nov 11 at 15:36
Willem Van Onsem
143k16135227
edited Nov 11 at 15:41
answered Nov 11 at 15:36
Willem Van Onsem
143k16135227
answered Nov 11 at 15:36
Willem Van Onsem
143k16135227
answered Nov 11 at 15:36
Willem Van Onsem
143k16135227
143k16135227
add a comment |
add a comment |
Thanks for contributing an answer to Stack Overflow!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53250262%2fbinary-addition-which-disapproves-carrying%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
