Previous bonus - Next bonus

Packet I: Bonus 3

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> | Packet-I_Berkeley-A_Cambridge-B_Notre-Dame-A_Oxford-A

HeardPPBE %M %H %
5810.6981%26%0%

Back to bonuses

Conversion

TeamOpponentPart 1Part 2Part 3TotalParts
Columbia BYale A010010E
Columbia CJohn Jay College010010E
George Washington AHaverford B010010E
Haverford APenn B010010E
Maryland AJohns Hopkins A0101020EM
NYU ACornell B001010M
NYU BGeorge Washington B0101020EM
Rutgers APenn A0101020EM
Vassar AMaryland B010010E

Summary

TournamentEditionMatchHeardPPBE %M %H %
Florida2025-02-01✓36.6767%0%0%
Great Lakes2025-02-01✓68.3383%0%0%
Lower Mid-Atlantic2025-02-01✓610.0067%33%0%
Midwest2025-02-01✓613.3383%50%0%
North2025-02-01✓33.3333%0%0%
Northeast2025-02-01✓516.00100%60%0%
Overflow2025-02-01✓47.5050%25%0%
Pacific Northwest2025-02-01✓210.00100%0%0%
South Central2025-02-01✓210.00100%0%0%
Southeast2025-02-01✓412.5075%50%0%
UK2025-02-01✓510.00100%0%0%
Upper Mid-Atlantic2025-02-01✓913.3389%44%0%
Upstate NY2025-02-01✓310.00100%0%0%