How to resolve the algorithm Hailstone sequence step by step in the Déjà Vu programming language

Published on 12 May 2024 09:40 PM
#Déjà vu

How to resolve the algorithm Hailstone sequence step by step in the Déjà Vu programming language

Table of Contents

Problem Statement

The Hailstone sequence of numbers can be generated from a starting positive integer,   n   by:

The (unproven) Collatz conjecture is that the hailstone sequence for any starting number always terminates.

This sequence was named by Lothar Collatz in 1937   (or possibly in 1939),   and is also known as (the):

The hailstone sequence is also known as   hailstone numbers   (because the values are usually subject to multiple descents and ascents like hailstones in a cloud).

Let's start with the solution:

Step by Step solution about How to resolve the algorithm Hailstone sequence step by step in the Déjà Vu programming language

Source code in the déjà programming language

local hailstone:
	swap [ over ]
	while < 1 dup:
		if % over 2:
			#odd
			++ * 3
		else:
			#even
			/ swap 2
		swap push-through rot dup
	drop
 
if = (name) :(main):
	local :h27 hailstone 27
	!. = 112 len h27
	!. = 27 h27! 0
	!. = 82 h27! 1
	!. = 41 h27! 2
	!. = 124 h27! 3
	!. = 8 h27! 108
	!. = 4 h27! 109
	!. = 2 h27! 110
	!. = 1 h27! 111
 
	local :max 0
	local :maxlen 0
	for i range 1 99999:
		dup len hailstone i
		if < maxlen:
			set :maxlen
			set :max i
		else:
			drop
	!print( "number: " to-str max ", length: " to-str maxlen )
else:
	@hailstone

You may also check:How to resolve the algorithm Smith numbers step by step in the RPL programming language
You may also check:How to resolve the algorithm String interpolation (included) step by step in the Stata programming language
You may also check:How to resolve the algorithm Dijkstra's algorithm step by step in the Phix programming language
You may also check:How to resolve the algorithm Knapsack problem/0-1 step by step in the JavaScript programming language
You may also check:How to resolve the algorithm Find the missing permutation step by step in the AutoHotkey programming language