Ternary Search Trees
Edit Page
Report
Scan day: 02 February 2014 UTC
17
Virus safety - good
Description: Fast Algorithms for Sorting and Searching Strings - The original paper and examples by Jon Bentley and Robert Sedgewick.
Jon Bentley and Robert Sedgewick When you have to store a set of strings, what data structure do you use? Jon and Bob suggest one place you can start is with ternary search trees, which combine the time efficiency of digital tries with the space efficiency of binary search trees.
Size: 280 chars
Contact Information
Email: —
Phone&Fax: —
Address: —
Extended: —
WEBSITE Info
| Page title: | Sorting and Searching Strings |
| Keywords: | |
| Description: | |
| IP-address: | 128.112.136.35 |
WHOIS Info
| NS | Name Servers: DNS.PRINCETON.EDU 128.112.129.15 DIKAHBLE.PRINCETON.EDU 128.112.134.4 |
| WHOIS | |
| Date | activated: 03-Apr-1987 last updated: 05-Oct-2010 expires: 31-Jul-2014 |