« earlier | later » Page 1 of 1

"A qp trie is like a crit-bit trie (aka patricia trie) except each branch is indexed by a few bits at a time instead of one bit. The array of sub-tries at a branch node is compressed using the popcount trick to omit unused branches." I'm thinking about teaching crit-bit tries in CMP201 next year...

to cmp201 data-structures trie ... on 06 April

« earlier | later » Page 1 of 1

- trie | |

1 | + cmp201 |

1 | + data-structures |

tasty by Adam Sampson.