Question

An algorithm created by this man uses stacks to assess arithmetic expressions in infix notation (15[1])and is named after a railroad structure. The output of that shunting yard algorithm can be converted into a notation system developed independently by this man and Frederick Bauer, representing “1 + 2 - 3” (“one plus two minus three”) as “1 2 + 3 -” (“one two plus three minus”). To rebel against spaghetti code, this man (15[1])popularized the phrase (*) “goto statement considered harmful.” An extension of an algorithm named after this man that uses heuristics is the A* (“a star”) algorithm. This man’s namesake algorithm does not work for edges with negative weights due to its greedy nature of finding the smallest edge to the next unvisited node. For 10 points, name this Dutch computer scientist whose namesake algorithm finds the shortest path in a graph. ■END■

ANSWER: Edsger Dijkstra (“DIKE-strah”) [or Edsger Wybe Dijkstra; accept Dijkstra’s algorithm]
<Ezra Santos, Other Science>
= Average correct buzz position

Back to tossups

Buzzes

PlayerTeamOpponentBuzz PositionValue
Kevin YeBerkeley CBerkeley B1415
Michal GerasimiukStanfordBerkeley A6215

Summary

2024 Penn Bowl UNC10/26/2024Y3100%33%0%72.33
2024 Penn Bowl Florida10/26/2024Y2100%0%50%102.50
2024 Penn Bowl Harvard10/26/2024Y4100%0%0%82.25
2024 Penn Bowl UK10/26/2024Y5100%0%0%70.80
2024 Penn Bowl Berkeley11/02/2024Y2100%100%0%38.00
2024 Penn Bowl Mainsite11/02/2024Y3100%0%33%96.67
2024 Penn Bowl CWRU11/02/2024Y4100%0%0%82.00
2024 Penn Bowl Chicago11/02/2024Y8100%13%13%84.38
2024 Penn Bowl Texas11/02/2024Y2100%0%50%110.00