An Idea Exchange for SAS software and services

Comments
by PROC Star
on ‎07-17-2015 06:42 AM

Doesn't an ordered hash table do the same thing?

by Super Contributor
on ‎07-17-2015 08:02 AM

You are partly right. With a sorted hash structure you can easily get the minum value.

However, the timecomplexity is higher for sorted hash than for a data heap. That is because if only the minimum value is of interest,  then there is no need to keep the whole list sorted.

by Trusted Advisor
on ‎07-17-2015 01:55 PM

A data heap is typically built on top of a sorted array, and keeps the whole sorted list in the array.  The interest often involves building a priority list based on the ordered values of a list.  I would recommend providing a more descriptive view of what you are looking for from this new data structure.

Idea Statuses
Top Liked Authors