{"openapi":"3.1.0","info":{"title":"Fibonacci Recursion Visualizer","description":"Step through and compare the naive recursive Fibonacci call tree against the memoized dynamic-programming version, with live call counts, cache hits and a filling memo table.","version":"1.0"},"servers":[{"url":"https://dabbled.ai"}],"paths":{"/apps/fibonacci-recursion-visualizer":{"get":{"operationId":"fibonacciRecursionVisualizer","summary":"Step through and compare the naive recursive Fibonacci call tree against the memoized dynamic-programming version, with live call counts, cache hits and a filling memo table.","parameters":[{"name":"n","in":"query","required":true,"description":"Fibonacci index n (0-40)","schema":{"type":"number"}},{"name":"algorithm","in":"query","required":false,"description":"Which algorithm(s) to visualize","schema":{"type":"string","enum":["Naive","Memoized","Both"]}},{"name":"speed","in":"query","required":false,"description":"Animation speed multiplier (0.25-4)","schema":{"type":"number"}},{"name":"color_mode","in":"query","required":false,"description":"Node coloring mode","schema":{"type":"string","enum":["call","return"]}},{"name":"show_memo_table","in":"query","required":false,"description":"Show memo / call-count table","schema":{"type":"boolean"}},{"name":"collapse_repeats","in":"query","required":false,"description":"Collapse repeated subtrees","schema":{"type":"boolean"}}],"responses":{"200":{"description":"Rendered app reflecting the given inputs."}}}}}}