def hailstone(n): h.append(int(n)) if n == 1: return h while n != 1: if n % 2 == 0: return hailstone(int(n/2)) else: return hailstone(int(3*n + 1)) y=int(input("N: ")) if y <= 0: print("N must be positive!") else: print("Hailstone sequences for 1 to " + str(y) + ": ") m=0; i=1 for x in range(1, y+1): n = i h = [] h = hailstone(n) print(*h) s=len(h) if s > m: m=s flag=n i=i+1 print("First longest sequence found in n =", + flag ) What if I still want the comma between each number. without any square brackets in frint and end.
def hailstone(n): h.append(int(n)) if n == 1: return h while n != 1: if n % 2 == 0: return hailstone(int(n/2)) else: return hailstone(int(3*n + 1)) y=int(input("N: ")) if y <= 0: print("N must be positive!") else: print("Hailstone sequences for 1 to " + str(y) + ": ") m=0; i=1 for x in range(1, y+1): n = i h = [] h = hailstone(n) print(*h) s=len(h) if s > m: m=s flag=n i=i+1 print("First longest sequence found in n =", + flag ) What if I still want the comma between each number. without any square brackets in frint and end.
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
def hailstone(n):
h.append(int(n))
if n == 1:
return h
while n != 1:
if n % 2 == 0:
return hailstone(int(n/2))
else:
return hailstone(int(3*n + 1))
y=int(input("N: "))
if y <= 0:
print("N must be positive!")
else:
print("Hailstone sequences for 1 to " + str(y) + ": ")
m=0;
i=1
for x in range(1, y+1):
n = i
h = []
h = hailstone(n)
print(*h)
s=len(h)
if s > m:
m=s
flag=n
i=i+1
print("First longest sequence found in n =", + flag )
What if I still want the comma between each number. without any square brackets in frint and end.
Transcribed Image Text:N: 6
Hailstone sequences for 1 to 6:
1
2 1
3 10 5 16 8 4 2 1
4 2 1
5 16 8 4 2 1
6 3 10 5 16 8 4 2 1
+ 2,
1
+ 3, 10, 5, 16, 8, 4, 2,
1
+ 4, 2, 1
+ 5, 16, 8, 4, 2, 1
+ 6, 3, 10, 5, 16, 8, 4, 2, 1
First longest sequence found inn =
Show explanation
> sample2
negative
> BIG
Hidden testcase
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY