How to resolve the algorithm Hailstone sequence step by step in the Brainf*** programming language

Published on 12 May 2024 09:40 PM
#Brainfuc

How to resolve the algorithm Hailstone sequence step by step in the Brainf*** 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 Brainf*** programming language

Source code in the brainfuc programming language

>>>>>>,>,>,<<

[
 .[-<+>]
]
>
[
 .[-<+>]
]
>
[
 .[-<+>]
]
<<<<


>------------------------------------------------[<<+>>-]>
[
    <<<
    [<+>-]<
    [>++++++++++<-]>
    >>>
    ------------------------------------------------
    [<<<+>>>-]>
    [
        <<<<
        [<+>-]<
        [>++++++++++<-]>
        >>>>
        ------------------------------------------------
        [<<<<+>>>>-]
    ]
    <

<<<[>+<<<+>>-]>[-<+>]>>>>>>>>>++++[>+++++++++++<-]++++[>>++++++++<<-]<<<<<<<<<<

[
    >>>>>>>>>>+>.>.<<<<<<<<<<<<
    >>+>+<<<        
    [-[->]<]+       
    >>>[>]          
    <[-<]<[-]<      

    [>+>+<<-]>[<+>-]+
    >[
    <<<[->>>>+>+>+<<<<<<]>>>>>>
    [-<<<<<<+>>>>>>]<[-<<<<<+>>>>>]<[-<<<<+>>>>]
    <<<<+>>
    -
    >[-]]
    <<[-]>[
    <<[-<+>[-<->>>>>+>]<<<<<]>>>>[-<<<<+>>>>]<<
    -]

    <<[->+>+<<]>[-<+>]>
    
    [>>+>+<<<-]>>>[<<<+>>>-]<<+>[<->[>++++++++++<[->-[>+>>]>[+[-<+>]>+>>]<<<<<]>[-]
    ++++++++[<++++++>-]>[<<+>>-]>[<<+>>-]<<]>]<[->>++++++++[<++++++>-]]<[.[-]<]<
    
    -[+>]<
]

[This program never terminates!                             ]
[This program isn't complete, (it only prints the hailstone ]
[sequence of a number until 1) but it may help other people ]
[to make complete versions.                                 ]
[                                                           ]
[This program only takes in up to 3 digit numbers as input  ]
[If you want to input 1 digit integers, add a 0 before. e.g ]
[04.                                                        ]
[                                                           ]
[Summary:                                                   ]
[This program takes 16 memory cells of space. Their data is ]
[presented below:                                           ]
[                                                           ]
[Cell 0: Temp cell.                                         ]
[Cell 1: Displays the current number. This changes based on ]
[Collatz' Conjecture.                                       ]
[Cell 14: Displays length of the hailstone sequence.        ]
[Cell 15: ASCII code for ",".                               ]
[Cell 16: ASCII code for " " (Space).                       ]
[Rest of the cells: Temp cells.                             ]

You may also check:How to resolve the algorithm 100 doors step by step in the Racket programming language
You may also check:How to resolve the algorithm Word wrap step by step in the Lua programming language
You may also check:How to resolve the algorithm Palindrome detection step by step in the Dyalect programming language
You may also check:How to resolve the algorithm Character codes step by step in the FreeBASIC programming language
You may also check:How to resolve the algorithm JSON step by step in the M2000 Interpreter programming language