X-fast trie
Channel:
Subscribers:
9,560
Published on ● Video Link: https://www.youtube.com/watch?v=veCI3QCRxUQ
1In computer science, an x-fast trie is a data structure for storing integers from a bounded domain. It supports exact and predecessor or successor queries in time O(log log M), using O(n log M) space, where n is the number of stored values and M is the maximum value in the domain. The structure was proposed by Dan Willard in 1982, along with the more complicated y-fast trie, as a way to improve the space usage of van Emde Boas trees, while retaining the O(log log M) query time.
Source: https://en.wikipedia.org/wiki/X-fast_trie
Created with WikipediaReaderSentry (c) WikipediaReader
Images and videos sourced from Pexels (https://www.pexels.com)
Other Videos By WikiReader
| 2023-02-01 | 2008 Summer Olympics closing ceremony |
| 2023-02-01 | Cortana (Halo) |
| 2023-02-01 | Sandy Pearlman |
| 2023-01-31 | Richard Garfield |
| 2023-01-31 | Boca Juniors in international football competitions |
| 2023-01-31 | Kari Berggrav |
| 2023-01-31 | Kenneth Noye |
| 2023-01-31 | 5th Marine Division (United States) |
| 2023-01-31 | Jordan Anderson |
| 2023-01-31 | Jefferson Township, Fayette County, Pennsylvania |
| 2023-01-31 | X-fast trie |
| 2023-01-31 | Russo-Polish War (1654–1667) |
| 2023-01-31 | Karl Shell |
| 2023-01-30 | Williams X-Jet |
| 2023-01-30 | Complete Rarities: Warner Bros. 1988–2011 |
| 2023-01-30 | Geronimo |
| 2023-01-30 | Language ideology |
| 2023-01-30 | Lenny Montana |
| 2023-01-30 | Shane Company |
| 2023-01-30 | Government College Chamba |
| 2023-01-30 | Interstellar Mapping and Acceleration Probe |