In easy to understand language can someone explain the premise behind Big O notation ? :rolleyes:

In easy to understand language can someone explain the premise behind Big O notation ? :rolleyes:

Big O is a measure of compelexity.

Basically, in laymans terms, it means the highest amount of complexity an algorithm will contain.

Mathmatically, for me its easier to understand.

IE

in the function X^2+7, once X becomes signifigantly large enough the constant value 7 is irrelevant towards predicting the complexity of the function. Hence the function would have a Big O of (X^2), thats X "squared" notation.

Be a part of the DaniWeb community

We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.