karthik M (3/16/2013)
Hello All,I just refreshed all my posts.
This is a very old post (asked on 2009) 🙂
How to identify whether a code fall under O(n) / O (n2) / O(n log n) by seeing the code ?
Most of us don't try and analyze our code to determine if it is O(n), O(n^2), or O(n log n). We test our code against expect data loads, and then unexpected loads (the million row test) and tune our code appropriately to achieve a scalable solution.