Question
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>
Summary
| Florida | 2025-02-01 | Y | 3 | 6.67 | 67% | 0% | 0% |
| Great Lakes | 2025-02-01 | Y | 6 | 8.33 | 83% | 0% | 0% |
| Lower Mid-Atlantic | 2025-02-01 | Y | 6 | 10.00 | 67% | 33% | 0% |
| Midwest | 2025-02-01 | Y | 6 | 13.33 | 83% | 50% | 0% |
| North | 2025-02-01 | Y | 3 | 3.33 | 33% | 0% | 0% |
| Northeast | 2025-02-01 | Y | 5 | 16.00 | 100% | 60% | 0% |
| Overflow | 2025-02-01 | Y | 4 | 7.50 | 50% | 25% | 0% |
| Pacific Northwest | 2025-02-01 | Y | 2 | 10.00 | 100% | 0% | 0% |
| South Central | 2025-02-01 | Y | 2 | 10.00 | 100% | 0% | 0% |
| Southeast | 2025-02-01 | Y | 4 | 12.50 | 75% | 50% | 0% |
| Upper Mid-Atlantic | 2025-02-01 | Y | 9 | 13.33 | 89% | 44% | 0% |
| Upstate NY | 2025-02-01 | Y | 3 | 10.00 | 100% | 0% | 0% |
Data
| Liberty A | Duke | 0 | 10 | 10 | 20 |
| South Carolina | Liberty B | 0 | 0 | 0 | 0 |
| UNC B | William & Mary | 0 | 10 | 10 | 20 |
| Virginia Tech A | UNC C | 0 | 10 | 0 | 10 |
| Virginia A | UNC D | 0 | 10 | 0 | 10 |
| Wake Forest | Liberty C | 0 | 0 | 0 | 0 |