Probabilistic Searching in Sorted Linked Lists
Janko [2] and Bentley, Stanat, and Steele [1] have described probabilistic procedures for data manipulation in sorted linnked lists. Their procedures are based on an algorithm which performs a Member search operation using 2N^1/2 + O(1) expected steps where N is the number of elements in the list. I...
| Main Authors: | , |
|---|---|
| Published: |
2023
|
| Online Access: | https://hdl.handle.net/1721.1/149057 |