Join devRant
Do all the things like
++ or -- rants, post your own rants, comment on others' rants and build your customized dev avatar
Sign Up
Pipeless API
From the creators of devRant, Pipeless lets you power real-time personalized recommendations and activity feeds using a simple API
Learn More
-
@alexbrooklyn Thanks for getting Rebecca Black stuck in my head
Time complexity doubt
How can you say T(n) ≤ 3T(floor(n/4)) + cn²
Given that T(n) =3T(floor(n/4)) +Θ(n²)
Won't it imply Θ(n²) ≤ cn², which seems incorrect (or am i wrong to think its incorrect?)
question