my coding in constructing a hailstone sequence results in endless circulation
I am trying to construct a hailstone sequence.Why can't it end the circulation and output the results?
def hailstone(n):
"""
print the hailstone sequence starting at n and return its length
"""
hail=[n]
while n>0:
if n%2==0:
n=n/2
hail.append(n)
#n=n/2
elif n%2==1:
n=n*3+1
hail.append(n)
#n=n*3+1
return hail
something like this:
>>> a = hailstone(10)
10
5
16
8
4
2
1
>>> a
7
python python-3.x
edited Dec 30 '18 at 9:07
Kasrâmvd
78.4k1089125
asked Dec 30 '18 at 8:46
weiwei Moweiwei Mo
1
add a comment |
I am trying to construct a hailstone sequence.Why can't it end the circulation and output the results?
def hailstone(n):
"""
print the hailstone sequence starting at n and return its length
"""
hail=[n]
while n>0:
if n%2==0:
n=n/2
hail.append(n)
#n=n/2
elif n%2==1:
n=n*3+1
hail.append(n)
#n=n*3+1
return hail
something like this:
>>> a = hailstone(10)
10
5
16
8
4
2
1
>>> a
7
python python-3.x
edited Dec 30 '18 at 9:07
Kasrâmvd
78.4k1089125
asked Dec 30 '18 at 8:46
weiwei Moweiwei Mo
1
I would suggest adding some print statements into each of your if checks right before your append call. That might allow you to see what it happening. It's not clear if your "something like this" is the actual output or the output you would like to get?
– Tom Johnson
Dec 30 '18 at 12:09
add a comment |
I am trying to construct a hailstone sequence.Why can't it end the circulation and output the results?
def hailstone(n):
"""
print the hailstone sequence starting at n and return its length
"""
hail=[n]
while n>0:
if n%2==0:
n=n/2
hail.append(n)
#n=n/2
elif n%2==1:
n=n*3+1
hail.append(n)
#n=n*3+1
return hail
something like this:
>>> a = hailstone(10)
10
5
16
8
4
2
1
>>> a
7
python python-3.x
edited Dec 30 '18 at 9:07
Kasrâmvd
78.4k1089125
asked Dec 30 '18 at 8:46
weiwei Moweiwei Mo
1
I am trying to construct a hailstone sequence.Why can't it end the circulation and output the results?
def hailstone(n):
"""
print the hailstone sequence starting at n and return its length
"""
hail=[n]
while n>0:
if n%2==0:
n=n/2
hail.append(n)
#n=n/2
elif n%2==1:
n=n*3+1
hail.append(n)
#n=n*3+1
return hail
something like this:
>>> a = hailstone(10)
10
5
16
8
4
2
1
>>> a
7
python python-3.x
python python-3.x
edited Dec 30 '18 at 9:07
Kasrâmvd
78.4k1089125
asked Dec 30 '18 at 8:46
weiwei Moweiwei Mo
1
edited Dec 30 '18 at 9:07
Kasrâmvd
78.4k1089125
asked Dec 30 '18 at 8:46
weiwei Moweiwei Mo
1
edited Dec 30 '18 at 9:07
Kasrâmvd
78.4k1089125
edited Dec 30 '18 at 9:07
Kasrâmvd
78.4k1089125
edited Dec 30 '18 at 9:07
Kasrâmvd
78.4k1089125
78.4k1089125
asked Dec 30 '18 at 8:46
weiwei Moweiwei Mo
1
asked Dec 30 '18 at 8:46
weiwei Moweiwei Mo
1
asked Dec 30 '18 at 8:46
weiwei Moweiwei Mo
1
1
I would suggest adding some print statements into each of your if checks right before your append call. That might allow you to see what it happening. It's not clear if your "something like this" is the actual output or the output you would like to get?
– Tom Johnson
Dec 30 '18 at 12:09
add a comment |
I would suggest adding some print statements into each of your if checks right before your append call. That might allow you to see what it happening. It's not clear if your "something like this" is the actual output or the output you would like to get?
– Tom Johnson
Dec 30 '18 at 12:09
I would suggest adding some print statements into each of your if checks right before your append call. That might allow you to see what it happening. It's not clear if your "something like this" is the actual output or the output you would like to get?
– Tom Johnson
Dec 30 '18 at 12:09
I would suggest adding some print statements into each of your if checks right before your append call. That might allow you to see what it happening. It's not clear if your "something like this" is the actual output or the output you would like to get?
– Tom Johnson
Dec 30 '18 at 12:09
add a comment |
1 Answer
1
active
oldest
votes
def hailstone(n):
"""
print the hailstone sequence starting at n and return its length
a = hailstone(10)
10
5
16
8
4
2
1
a
7
"""
count=1
while n>=1:
if n==1:
print(n)
break
elif n%2==0:
print(n)
count+=1
n=n//2
else:
print(n)
count+=1
n=3*n+1
return count
a=hailstone(10)
a
b=hailstone(27)
b
remember to set break
answered Dec 30 '18 at 9:19
weiwei Moweiwei Mo
1
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%2f53976288%2fmy-coding-in-constructing-a-hailstone-sequence-results-in-endless-circulation%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
def hailstone(n):
"""
print the hailstone sequence starting at n and return its length
a = hailstone(10)
10
5
16
8
4
2
1
a
7
"""
count=1
while n>=1:
if n==1:
print(n)
break
elif n%2==0:
print(n)
count+=1
n=n//2
else:
print(n)
count+=1
n=3*n+1
return count
a=hailstone(10)
a
b=hailstone(27)
b
remember to set break
answered Dec 30 '18 at 9:19
weiwei Moweiwei Mo
1
add a comment |
def hailstone(n):
"""
print the hailstone sequence starting at n and return its length
a = hailstone(10)
10
5
16
8
4
2
1
a
7
"""
count=1
while n>=1:
if n==1:
print(n)
break
elif n%2==0:
print(n)
count+=1
n=n//2
else:
print(n)
count+=1
n=3*n+1
return count
a=hailstone(10)
a
b=hailstone(27)
b
remember to set break
answered Dec 30 '18 at 9:19
weiwei Moweiwei Mo
1
add a comment |
def hailstone(n):
"""
print the hailstone sequence starting at n and return its length
a = hailstone(10)
10
5
16
8
4
2
1
a
7
"""
count=1
while n>=1:
if n==1:
print(n)
break
elif n%2==0:
print(n)
count+=1
n=n//2
else:
print(n)
count+=1
n=3*n+1
return count
a=hailstone(10)
a
b=hailstone(27)
b
remember to set break
answered Dec 30 '18 at 9:19
weiwei Moweiwei Mo
1
def hailstone(n):
"""
print the hailstone sequence starting at n and return its length
a = hailstone(10)
10
5
16
8
4
2
1
a
7
"""
count=1
while n>=1:
if n==1:
print(n)
break
elif n%2==0:
print(n)
count+=1
n=n//2
else:
print(n)
count+=1
n=3*n+1
return count
a=hailstone(10)
a
b=hailstone(27)
b
remember to set break
answered Dec 30 '18 at 9:19
weiwei Moweiwei Mo
1
answered Dec 30 '18 at 9:19
weiwei Moweiwei Mo
1
answered Dec 30 '18 at 9:19
weiwei Moweiwei Mo
1
answered Dec 30 '18 at 9:19
weiwei Moweiwei Mo
1
1
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.
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%2f53976288%2fmy-coding-in-constructing-a-hailstone-sequence-results-in-endless-circulation%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
I would suggest adding some print statements into each of your if checks right before your append call. That might allow you to see what it happening. It's not clear if your "something like this" is the actual output or the output you would like to get?
– Tom Johnson
Dec 30 '18 at 12:09