Binary heaps are often used for priority queues and priority queues are used everywhere. Especially if you have a huge stream of data and only want to keep track of a small number matching a specific ranking. This is used in computer games, event driven simulation among many others. Priority queues are extremely handy and useful. I've just learned about them and I'm always trying to find places to implement them for improved benefit.
Nice read overall!
I hate date structure and algorithm questions in interviews. It's a solid article though. Bookmarked for another day, when my head isn't jammed with all the work stuff.
2 comments
[ 261 ms ] story [ 1204 ms ] thread