Results from the 2022 Developer Survey are now available
Computer Science

Nice Question

 Nice Question
Question score of 10 or more. This badge can be awarded multiple times.

earned this badge 3 times.
Proof that a randomly built binary search tree has logarithmic height
Awarded Nov 12, 2018 at 19:15
Modifying Dijkstra's algorithm for edge weights drawn from range $[1,…,K]$
Awarded Jul 22, 2018 at 7:19
Bellman-Ford algorithm - Why can edges be updated out of order?
Awarded Feb 25, 2016 at 14:01

Others with this badge

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.