Pages tagged o:

A Beginners’ Guide to Big O Notation « Rob Bell

Big O notation is used in Computer Science to describe the performance or complexity of an algorithm. Big O specifically describes the worst-case scenario, and can be used to describe the execution time required or the space used (e.g. in memory or on disk) by an algorithm.
baseplane - technology platforms » Big O Notation in Design Theory » baseplane - technology platforms