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>
| Editions | Heard | PPB | Easy % | Medium % | Hard % |
|---|---|---|---|---|---|
| 1 | 58 | 10.69 | 81% | 26% | 0% |
Conversion
Summary
| Tournament | Edition | Heard | PPB | Easy % | Medium % | Hard % |
|---|---|---|---|---|---|---|
| Florida | 2025-02-01 | 3 | 6.67 | 67% | 0% | 0% |
| Great Lakes | 2025-02-01 | 6 | 8.33 | 83% | 0% | 0% |
| Lower Mid-Atlantic | 2025-02-01 | 6 | 10.00 | 67% | 33% | 0% |
| Midwest | 2025-02-01 | 6 | 13.33 | 83% | 50% | 0% |
| North | 2025-02-01 | 3 | 3.33 | 33% | 0% | 0% |
| Northeast | 2025-02-01 | 5 | 16.00 | 100% | 60% | 0% |
| Overflow | 2025-02-01 | 4 | 7.50 | 50% | 25% | 0% |
| Pacific Northwest | 2025-02-01 | 2 | 10.00 | 100% | 0% | 0% |
| South Central | 2025-02-01 | 2 | 10.00 | 100% | 0% | 0% |
| Southeast | 2025-02-01 | 4 | 12.50 | 75% | 50% | 0% |
| UK | 2025-02-01 | 5 | 10.00 | 100% | 0% | 0% |
| Upper Mid-Atlantic | 2025-02-01 | 9 | 13.33 | 89% | 44% | 0% |
| Upstate NY | 2025-02-01 | 3 | 10.00 | 100% | 0% | 0% |