Ranter
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
Comments
-
stop68674yO(N) - time required grows linear with the amount of items
O(1) - time required stays always the same
O(log N) - time grows logarithmic to the amount of items
O(N^2) - time required grows quadratic to the amount of items -
@Berkmann18 @alexbrooklyn I think I got it. It helped once I learned what asymptotic meant lol
big o notation is confusing
random