Collatz conjecture Simple Finder Program

Description

A $${\color{greenyellow}Simple \space \color{blue}Portable \space \color{green}Python}$$ Program for people to discover Collatz Conjecture $${\color{red}maximum \space \color{red}steps}$$ numbers.

A small project I created back in 2022, haven't had the time to fix the bugs. Now it should be all settled. Added a timely update for people who are anxious about whether or not the program is malfunctioning(aka stuck in an infinite while loop). As mathematicians have not yet found the possibility of a number with infinite steps. I have not yet considered that edge case at the current moment.

Honestly speaking, I wasn't thinking about putting it out, but just realized that all my time of self-learning Python came from LeetCode. So here we are.

Potential Update

• Output a CSV file for the result
• A matplotlib graph, maybe, in a different version?
• Reduce the base number in power, and include the suggested power, or directly continue from the last number. (Up to the user's decision)

My honest suggestion

When giving the program a try on a larger starting power, make sure that you know how to stop a program (a.k.a keyboard interrupt, Ctrl+C in Linux and Windows Terminal) Or else this program will run infinitely and consume majority of your CPU power.