Top of the Heap was the first spin-off from FOX's most successful program Married... with Children. It chronicled the escapades of a father who is trying to get his son hooked up with a rich broad. One of the things working against him is the fact that his son is on the same intelligence level as Kelly Bundy. Vinnie falls into a job at Rolling Hills country club, where he becomes very popular with ladies; however, most of them are old and married. And as with any spin-off series, characters from the parent series would often make an appearance to start the show off on a higher ratings note, which in this series didn't help. Not one to give in, Ron Leavitt, co-creator of Married... with Children has brought Vinnie's character back in the spring of '92 with a series called Vinnie & Bobby; this series is chronicled in another entry.
Runtime: 30 minutes
Top of the Heap - Heapsort - Netflix
In computer science, heapsort is a comparison-based sorting algorithm. Heapsort can be thought of as an improved selection sort: like that algorithm, it divides its input into a sorted and an unsorted region, and it iteratively shrinks the unsorted region by extracting the largest element and moving that to the sorted region. The improvement consists of the use of a heap data structure rather than a linear-time search to find the maximum. Although somewhat slower in practice on most machines than a well-implemented quicksort, it has the advantage of a more favorable worst-case O(n log n) runtime. Heapsort is an in-place algorithm, but it is not a stable sort. Heapsort was invented by J. W. J. Williams in 1964. This was also the birth of the heap, presented already by Williams as a useful data structure in its own right. In the same year, R. W. Floyd published an improved version that could sort an array in-place, continuing his earlier research into the treesort algorithm.
Top of the Heap - Algorithm - Netflix
The heapsort algorithm involves preparing the list by first turning it into a max heap. The algorithm then repeatedly swaps the first value of the list with the last value, decreasing the range of values considered in the heap operation by one, and sifting the new first value into its position in the heap. This repeats until the range of considered values is one value in length. The steps are: Call the buildMaxHeap() function on the list. Also referred to as heapify(), this builds a heap from a list in O(n) operations. Swap the first element of the list with the final element. Decrease the considered range of the list by one. Call the siftDown() function on the list to sift the new first element to its appropriate index in the heap. Go to step (2) unless the considered range of the list is one element. The buildMaxHeap() operation is run once, and is O(n) in performance. The siftDown() function is O(log n), and is called n times. Therefore, the performance of this algorithm is O(n + n log n) = O(n log n).
Top of the Heap - References - Netflix