In this instance, you're only concerned with the average case. Worst case is inf... | Hacker News

Hacker News new | past | comments | ask | show | jobs | submit

login

nwallin on Aug 3, 2020 | parent | context | favorite | on: A ride that takes 10^20k years to complete in Roll...

In this instance, you're only concerned with the average case.

Worst case is infinite: you just always take the path back in the direction of the entrance, and never even get past the first inlet.

Best case is O(n): you always take the path forward.

jchw on Aug 3, 2020 [–]

Yep, sorry, it quickly became apparent after rereading this that the original analysis was not worst-case. I have revised my comment to also include how I view calculating the actual time complexity since I didn't actually do that initially.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact