| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2024-07-26 | Queue based iteration procedure | Aryadev Chavali | |
| Pops an item off the queue and generate left and right children for it, if those are empty. Then push those children into the queue for the next iteration. NOTE: Because we're using a queue, this does a breadth first generation of the tree, which is what we want. | |||
| 2024-07-26 | Binary tree of fractions | Aryadev Chavali | |
| Will be used in creating the cw tree. | |||
| 2024-07-26 | Simplify at constructor in Fraction | Aryadev Chavali | |
| Let's just deal with simplified stuff anyway? | |||
| 2024-07-26 | Added comparators to Fraction struct | Aryadev Chavali | |
| 2024-07-26 | Extracted gcd algorithm into its own function | Aryadev Chavali | |
| 2024-07-26 | Simple fraction structure | Aryadev Chavali | |
| Holds numerator and denominator. Can self simplify, but not automatically. | |||
| 2024-07-26 | Hello, world! | Aryadev Chavali | |
 |
index : cw_tree | |
| A visualisation of a Calkin-Wilf tree | Aryadev Chavali <aryadev@aryadevchavali.com> |
| aboutsummaryrefslogtreecommitdiff |