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) print(",") s=len(h) if s > m: m=s flag=n i=i+1 print("First longest sequence found in n =", + flag ) How can I fix this code if I want a comma between each number, not each line? 24n = iDIFF SPLIT DIFF YOUR OUTPUT EXPECTEDh = []hailstone(n)2526hN: 6print(*h)print(",")27Hailstone sequences for 1 to 6:2829s=len(h)30if s > m:2 131m=sflag=ni=i+1print("First longest sequence found in n ="323 10 5 16 8 4 2 13334+ flag )4 2 135365 16 8 4 2 137386 3 10 5 16 8 4 2 1/home/hailstones.py 35:1 Spaces: 2 (Auto)All changes saved+ 2,1TerminalMark+ 3, 10, 5, 16, 8, 4, 2,12 1Reset+ 4, 2, 1+ 5, 16, 8, 4, 2, 1+ 6, 3, 10, 5, 16, 8, 4, 2,First longest sequence found in n = 63 10 5 16 8 4 2 114 2 1Show explanation5 16 8 4 2 1> sample26 3 10 5 16 8 4 2 1negativeFirst longest sequence found in n = 6[user@sahara ~]$ ]DIC

Answered: w can I fix this code if I want a comma…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

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)
print(",")
s=len(h)
if s > m:
m=s
flag=n
i=i+1
print("First longest sequence found in n =", + flag )

How can I fix this code if I want a comma between each number, not each line?

24
n = i
DIFF SPLIT DIFF YOUR OUTPUT EXPECTED
h = []
hailstone(n)
25
26
h
N: 6
print(*h)
print(",")
27
Hailstone sequences for 1 to 6:
28
29
s=len(h)
30
if s > m:
2 1
31
m=s
flag=n
i=i+1
print("First longest sequence found in n ="
32
3 10 5 16 8 4 2 1
33
34
+ flag )
4 2 1
35
36
5 16 8 4 2 1
37
38
6 3 10 5 16 8 4 2 1
/home/hailstones.py 35:1 Spaces: 2 (Auto)
All changes saved
+ 2,
1
Terminal
Mark
+ 3, 10, 5, 16, 8, 4, 2,
1
2 1
Reset
+ 4, 2, 1
+ 5, 16, 8, 4, 2, 1
+ 6, 3, 10, 5, 16, 8, 4, 2,
First longest sequence found in n = 6
3 10 5 16 8 4 2 1
1
4 2 1
Show explanation
5 16 8 4 2 1
> sample2
6 3 10 5 16 8 4 2 1
negative
First longest sequence found in n = 6
[user@sahara ~]$ ]
DIC

Expert Solution

Step by step

Solved in 5 steps with 2 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions