Dynamic algorithms for partially-sorted lists
The dynamic partial sorting problem asks for an algorithm that maintains lists of numbers under the link, cut and change value operations, and queries the sorted sequence of the k least numbers in one of the lists. We examine naive solutions to the problem and demonstrate why they are not adequate....
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Published: |
Auckland University of Technology,
2015-11-09T02:44:45Z.
|
| Subjects: | |
| Online Access: | Get fulltext |