Apr 30, 2017

[HDGEM] What is Big O Notation

It is the relative representation of the complexity of an algorithm.
It describes how an algorithm performs and scales.
It describes the upper bound of the growth rate of a function and could be thought of the worst case scenario.

Posted By Blogger to HDGEM at 4/30/2017 01:40:00 PM
Post a Comment

Featured Post


Google Tables helps you search thousands of public Fusion Tables, or millions of public tables from around the web you can import to Fusio...