That’s literally all there is to it.
That’s literally all there is to it.
For a simple example of how it's a lot more than that, follow Tarjan's proof of the disjoint set's amortized time complexity[0]. It's not at all obvious, even though the disjoint set is a very simple and practical data structure.
[0]: http://www.e-maxx.ru/bookz/files/dsu/Efficiency%20of%20a%20G...
https://en.wikipedia.org/wiki/List_of_unsolved_problems_in_c...
And doesn't getting the data in and out already take O(N)?
Even some graph operations will leave familiar territory.
A matrix can always be split into groups of sub-matrix, and the groups of sub-matrix is itself a matrix. Applying Strassen algorithm recursively is therefore O(n^log2(7)) == O(n^2.8ish).
https://www.wolframalpha.com/input/?i=f%281%29+%3D+1%2C+f%28...