Question

Algorithms that use this concept can be analyzed with the Akra-Bazzi method, which generalizes the three different cases of algorithms using this concept that can be analyzed with the master theorem. Many functional programming languages like Lisp use this concept’s “tail” form to (10[1])implement iteration. (10[1])This concept is conventionally used in implementations of depth-first-search (10[3])and algorithms like quicksort (10[1])that (-5[1])are divide-and-conquer. (10[1])The Towers of Hanoi problem can be solved with this programming concept, (10[1])which requires defining a base case and a namesake step. For 10 points, name this concept in which a function calls itself. ■END■ (10[1])

ANSWER: recursion [accept word forms; accept tail recursion; prompt on divide-and-conquer until read]
<Other Science>
= Average correct buzz position

Back to tossups

Buzzes

PlayerTeamOpponentBuzz PositionValue
Alec RisoCornell DSyracuse4210
Victor BenderPenn StateCornell B4410
Aidan RoulletRIT ARIT C5310
Aidan KeenanU of Rochester AESF5310
Gary WangU of Rochester BBinghamton C5310
Jonathan ZhangCornell FCornell A5710
Owen LinderBinghamton ARIT B58-5
Shalin ZerbeBinghamton BCornell G6010
Pranaav SenthilkumarCornell CCornell E7210
Will HooverRIT BBinghamton A9510

Summary

2024 ACF Fall at CornellfallY9100%0%11%58.78
2024 ACF Fall at Ohio StatefallY888%0%25%61.71
2024 ACF Fall at WashingtonfallY6100%0%0%41.17
2024 ACF Fall at GeorgiafallY1090%0%30%61.56
2024 ACF Fall at North CarolinafallY8100%0%25%76.25
2024 ACF Fall at Claremont CollegesfallY5100%0%20%51.00
2024 ACF Fall at RutgersfallY8100%0%13%72.88
2024 ACF Fall at RutgersfallY888%0%38%51.86
2024 ACF Fall at IllinoisfallY8100%0%0%46.00