Bonus

Previous bonus - Next bonus
Early implementations of this algorithm exhibited its worst-case runtime on sorted arrays, which can be avoided using the “median-of-three” rule. For 10 points each:
[10m] Name this divide-and-conquer algorithm that repeatedly partitions an array about a pivot, moves smaller values to the left of the pivot, and moves larger values to the right of the pivot.
ANSWER: quicksort [or partition-exchange sort; reject “exchange sort”]
[10e] A sorted list admits a search algorithm named for this word that also works by repeated partition. Computer science typically works in a base with this name, which is synonymous with base-2.
ANSWER: binary [accept binary search]
[10h] The parity of k partitions of a string of 2 to the k binary digits is checked in an “extended” error correction code named for this American computer scientist, which is robust when his namesake “distance” is at most 1.
ANSWER: Richard Hamming [accept Hamming code or extended Hamming code; accept Hamming distance]
<Editors, Other Science>

EditionsHeardPPBEasy %Medium %Hard %
212514.4895%31%18%

Back to bonuses

Conversion

TeamOpponentPart 1Part 2Part 3TotalParts
Claremont BUCLA B10101030MEH
Claremont CUC Irvine010010E
UC Santa BarbaraUCLA C010010E
UCLA DClaremont A010010E
UCLA EUSC A1010020ME
UCSD BUCSD A1010020ME
USC BUCLA A10101030MEH

Summary

TournamentEditionExact Match?HeardPPBEasy %Medium %Hard %
UK (North)UKY522.00100%60%60%
UK (South)UKY720.00100%43%57%
Northern CaliforniaUSY415.00100%25%25%
Southern CaliforniaUSY718.57100%57%29%
Eastern Canada (1)USY510.0080%0%20%
Eastern Canada (2)USY914.44100%33%11%
FloridaUSY410.0075%25%0%
Great LakesUSY1216.67100%33%33%
Lower Mid-AtlanticUSY911.11100%11%0%
Upper Mid-AtlanticUSY1013.0090%40%0%
Upper Mid-AtlanticUSY225.00100%100%50%
MidwestUSY916.67100%33%33%
NorthUSY417.50100%50%25%
NortheastUSY1110.9182%18%9%
PacificUSY88.7588%0%0%
SoutheastUSY1313.85100%31%8%
Upstate NYUSY613.33100%33%0%