{"version":"1.0","type":"rich","title":"n/2 matching numbers : pseudocode","description":"This example demonstrates a pseudocode representation of the n/2 majority element problem, showing how to identify a number that appears more than half the time in an array. The page displays a hardcoded test array `[1, 2, 4, 4, 4, 4, 4, 13, 10, 6]` and a target number `4`, then logs the indices where the number matches via `console.log` in a `for` loop. The visualization presents the pseudocode alongside the algorithm’s logic, though it renders no graphical output or charts, relying solely on HTML body text and JavaScript execution.","provider_name":"VizHub AI Studio","provider_url":"https://vizhub.com","html":"<iframe src=\"https://vizhub.com/viz/f3b1dfeaf0cd4cd0ab539fb15ff7abc9?mode=embed\" width=\"960\" height=\"500\" scrolling=\"no\" frameborder=\"0\"></iframe>","width":960,"height":500,"cache_age":3600}