binairy tree climbing clear solution for Exploring Calkin-Wilf Tree by Tinus_Trotyl - python coding challenges

Enable Javascript in your browser and then refresh this page, for a much enhanced experience.

binairy tree climbing solution in Clear category for Exploring Calkin-Wilf Tree by Tinus_Trotyl

def calkin_wilf(n: int) -> tuple[int, int]:
    a, b = 1, 1
    for x in bin(n)[3:]: # for all less significant bits of binairy number "n"
        match x:
            case "0": a, b = a, a + b
            case "1": a, b = a + b, b
    return a, b

Dec. 23, 2023

Comments:

veky on May 5, 2024, 7:51 a.m.
Mine is the same, only with less boilerplate. :)

Tinus_Trotyl on May 6, 2024, 2:06 a.m.
Yeah, I see what you mean, too much kettles and pans. But, I didn't like that "If Else" thing neither ... <a href="https://py.checkio.org/mission/exploring-calkin-wilf-tree/publications/Tinus_Trotyl/python-3/second/?ordering=most_voted&filtering=all">Cooking `a` and `b` in a list by the use of indexing</a> tho, will save us more space on the stove :)

veky on May 6, 2024, 5:35 a.m.
You should have seen @StefanPochmann, he cooks them in a dictionary. :-D

Tinus_Trotyl on May 6, 2024, 12:54 p.m.
Who are we to see . . . Stefan's ways can be both incomprehensible and unfathomable for normal mortals . . .

Rock

0 %

You ClassRoom Demo is Ready With the new tool CheckiO ClassRoom, you will be able to analyze your students' progress, have your own leaderboard, change missions order on the map, and so on.