checkout
view
Your Cart: item(s)
Computer Science, Data Structures and Algorithms
Other
merging sorted lists using Heaps
I need help figuring out an algorithm that will merge k sorted lists into one sorted lists in O(n lg k) time where n is the number of elements in ALL the input lists.
I believe we are supposed to use a Heap for k-way merging.
By OTA: Israel Kovner, PhD
OTA Rating: 5/5
Your Price: $2.19 (original value ~$23.94)
What's included:
- Plain text response
Page generated in 0.0137 seconds