A Linear List Merging Algorithm
| dc.contributor.author | Hopcroft, John E. | |
| dc.contributor.author | Ullman, Jeffrey D. | |
| dc.date.accessioned | 2008-05-14T13:42:16Z | |
| dc.date.available | 2008-05-14T13:42:16Z | |
| dc.date.issued | 2008-05-14T13:42:16Z | |
| dc.description.abstract | A linear list merging algorithm and its analysis is presented. Starting with n lists, each containing a single element, the algorithm will execute an arbitrary sequence of requests to merge lists and to find the name of the list currently containing a given element. If the length of the sequence of requests is bounded by a constant times n, then the execution time of the algorithm on a random access computer is bounded by a constant times n. | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/10810 | |
| dc.subject | merging lists | en_US |
| dc.subject | list merging algorithms | en_US |
| dc.subject | algorithm | en_US |
| dc.title | A Linear List Merging Algorithm | en_US |
Files
Original bundle
1 - 1 of 1