Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
indigo945
on July 29, 2022
|
parent
|
context
|
favorite
| on:
Timsort (2019)
This may be the same author ... Anyway f(n)=n is definitely a polynomial and O(n) is a class of algorithms that run in polynomial time (i.e. are in P).
Join us for
AI Startup School
this June 16-17 in San Francisco!
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: