Skip to content
Better HN
Top
Best
Ask
Show
New
Jobs
Search
⌘K
0 points
kqr
8y ago
0 comments
Save
Share
Prove running time as in complexity analysis is more analysis than algebra though, right?
0 comments
1 comments · 1 top-level
top
newest
oldest
saagarjha
8y ago
Depends. There's not a whole lot of analysis you can do on sufficiently complex recursive algorithms.
j
/
k
navigate · click thread line to collapse