We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
It isn't true that an algorithm can be made O(1) by hiding detail in a library or function call. You still have to account for the running time of that function call.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Sherlock and Squares
You are viewing a single comment's thread. Return to all comments →
It isn't true that an algorithm can be made O(1) by hiding detail in a library or function call. You still have to account for the running time of that function call.