Prove running time as in complexity analysis is more analysis than algebra thoug... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

kqr on Jan 23, 2018 | parent | context | favorite | on: Why Discrete Math Is Important

Prove running time as in complexity analysis is more analysis than algebra though, right?

saagarjha on Jan 23, 2018 [–]

Depends. There's not a whole lot of analysis you can do on sufficiently complex recursive algorithms.

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