Bonus

Note to moderator: Review the pronunciation of the first answerline when judging. The burstsort algorithm uses dynamic arrays and these data structures to achieve cache-aware sorting. For 10 points each:
[10h] Name these data structures whose memory-optimized form can be used to implement radix sort. Bitwise implementations of these data structures can be optimized into their “x-fast” and “y-fast” forms.
ANSWER: trie (“try”) [or tries; or prefix trees; prompt on search trees]
[10e] Tries (“try’s”) commonly use prefixes of these data types as keys, which can then be parsed in search engines. In C, these data types are defined as null-terminated arrays of characters.
ANSWER: strings [prompt on words or text]
[10m] A trie (“try”) is the output of this efficient greedy algorithm for lossless compression in which more frequently-accessed strings correspond to shorter prefix codes.
ANSWER: Huffman coding
<MY, Other Science>

EditionsHeardPPBEasy %Medium %Hard %
15810.6981%26%0%

Back to bonuses

Conversion

TeamOpponentPart 1Part 2Part 3TotalParts
Bruin AAlabama A001010M
Georgia Tech BVanderbilt A0101020EM
Georgia Tech CLouisville A010010E
Tennessee AGeorgia Tech A010010E

Summary

TournamentEditionHeardPPBEasy %Medium %Hard %
Florida2025-02-0136.6767%0%0%
Great Lakes2025-02-0168.3383%0%0%
Lower Mid-Atlantic2025-02-01610.0067%33%0%
Midwest2025-02-01613.3383%50%0%
North2025-02-0133.3333%0%0%
Northeast2025-02-01516.00100%60%0%
Overflow2025-02-0147.5050%25%0%
Pacific Northwest2025-02-01210.00100%0%0%
South Central2025-02-01210.00100%0%0%
Southeast2025-02-01412.5075%50%0%
UK2025-02-01510.00100%0%0%
Upper Mid-Atlantic2025-02-01913.3389%44%0%
Upstate NY2025-02-01310.00100%0%0%