{"version":"1.0","type":"rich","title":"HeapSort implementation","description":"HeapSort implementation demonstrates the classic heapsort algorithm sorting a randomly generated integer array. The code builds a max heap from an unsorted array of ten random integers, then repeatedly extracts the maximum element to produce a sorted sequence. The visualization uses Java's `SimpleWriter` and `SimpleWriter1L` APIs from the components library to output both the initial unsorted values and the final sorted result to the console. The program generates its data source internally using `Math.random()` to create pseudorandom integers between 0 and 199, then prints each stage of the process, showing the array before and after sorting.","provider_name":"VizHub AI Studio","provider_url":"https://next.vizhub.com","html":"<iframe src=\"https://next.vizhub.com/viz/gist-560ee59a64271101108eedcfedf72343?mode=embed\" width=\"960\" height=\"500\" scrolling=\"no\" frameborder=\"1\"></iframe>","width":960,"height":500,"cache_age":3600}