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

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


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

Search: