Algorithmic Complexity and Big O Notation
I was listening to the Algorithmic Complexity on Coding Block and they were talking about the dangers of O(n 2) . When I am doing a lot of metadata related coding I will quite often do O(n 2).
But when I started going over any data collections I have to be a lot more careful of my loops and make sure that the performance is more linear. Big O notation is an approximation so O(n/2) gets simplified to O(n). See Big O Cheat Sheet that was mentioned in the blog.
Comments