{"version":"1.0","type":"rich","title":"Gist 3852c326558525b3b1489f2be531f4b5","description":"This visualization compares the performance of two JavaScript implementations of a \"persistent bugger\" algorithm, which calculates the persistence of a number by repeatedly multiplying its digits until a single digit remains. The benchmark, generated via perf.link, plots execution times (in operations per second) for the recursive `persistenceA` versus the iterative `persistenceB` approach across repeated test runs on the input 99999. A linked bar chart visualizes the runtime distributions, making it easy to compare the relative efficiency of the two code variants.","provider_name":"VizHub AI Studio","provider_url":"https://next.vizhub.com","html":"<iframe src=\"https://next.vizhub.com/viz/gist-3852c326558525b3b1489f2be531f4b5?mode=embed\" width=\"960\" height=\"500\" scrolling=\"no\" frameborder=\"1\"></iframe>","width":960,"height":500,"cache_age":3600}