{"version":"1.0","type":"rich","title":"Fork of Fork of nlogn algorithm for n/2 matching numbers : with psuedocode","description":"This example demonstrates a brute-force algorithm that searches for matching numbers in an array by repeatedly halving the search range. The visualization shows a console output of the number `4` appearing in the array `[2, 4, 4, 4, 3, 6]`. The code uses plain JavaScript with a `while` loop and `Math.floor` to divide the array length, iterating through indices to log matches. No external libraries are used; the rendering relies entirely on the browser’s default console and HTML body styling with a large font size.","provider_name":"VizHub AI Studio","provider_url":"https://vizhub.com","html":"<iframe src=\"https://vizhub.com/viz/80ed39bb26f74822a319950f194b4782?mode=embed\" width=\"960\" height=\"500\" scrolling=\"no\" frameborder=\"0\"></iframe>","width":960,"height":500,"cache_age":3600}