Another update from ingydotnet^djgoku

Task/Hailstone-sequence/BASIC/hailstone-sequence-7.basic

@@ -1,42 +1,40 @@
-Module HailstoneSequence
-    Sub Main()
-        ' Checking sequence of 27.
+print "Part 1: Create a routine to generate the hailstone sequence for a number."
+print ""
 
-        Dim l As List(Of Long) = HailstoneSequence(27)
-        Console.WriteLine("27 has {0} elements in sequence:", l.Count())
+while hailstone < 1 or hailstone <> int(hailstone)
+    input "Please enter a positive integer: "; hailstone
+wend
+count = doHailstone(hailstone,"Y")
 
-        For i As Integer = 0 To 3 : Console.Write("{0}, ", l(i)) : Next
-        Console.Write("... ")
-        For i As Integer = l.Count - 4 To l.Count - 1 : Console.Write(", {0}", l(i)) : Next
+print: print "Part 2: Use the routine to show that the hailstone sequence for the number 27 has 112 elements starting with 27, 82, 41, 124 and ending with 8, 4, 2, 1."
+count = doHailstone(27,"Y")
 
-        Console.WriteLine()
+print: print "Part 3: Show the number less than 100,000 which has the longest hailstone sequence together with that sequence's length.(But don't show the actual sequence)!"
+print "Calculating result... Please wait... This could take a little while..."
+print "Stone Percent Count"
+for i = 1 to 99999
+   count = doHailstone(i,"N")
+	if count > maxCount then
+	   theBigStone = i
+	   maxCount	= count
+     print using("#####",i);" ";using("###.#", i / 99999 * 100);"% ";using("####",count)
+     end if
+next i
+end
 
-        ' Finding longest sequence for numbers below 100000.
-
-        Dim max As Integer = 0
-        Dim maxCount As Integer = 0
-
-        For i = 1 To 99999
-            l = HailstoneSequence(i)
-            If l.Count > maxCount Then
-                max = i
-                maxCount = l.Count
-            End If
-        Next
-        Console.WriteLine("Max elements in sequence for number below 100k: {0} with {1} elements.", max, maxCount)
-        Console.ReadLine()
-    End Sub
-
-    Private Function HailstoneSequence(ByVal n As Long) As List(Of Long)
-        Dim valList As New List(Of Long)()
-        valList.Add(n)
-
-        Do Until n = 1
-            n = IIf(n Mod 2 = 0, n / 2, (3 * n) + 1)
-            valList.Add(n)
-        Loop
-
-        Return valList
-    End Function
-
-End Module
+'---------------------------------------------
+' pass number and print (Y/N)
+FUNCTION doHailstone(hailstone,prnt$)
+if prnt$ = "Y" then
+ print
+ print "The following is the 'Hailstone Sequence' for number:";hailstone
+end if
+while hailstone <> 1
+   if (hailstone and 1) then hailstone = (hailstone * 3) + 1 else hailstone = hailstone / 2
+   doHailstone = doHailstone + 1
+   if prnt$ = "Y" then
+    print hailstone;chr$(9);
+    if (doHailstone mod 10) = 0 then print
+   end if
+wend
+END FUNCTION