29 MAY 2013 by ideonexus

 Simple Explanation of Big O Notation

The simplest definition I can give for Big-O notation is this: Big-O notation is a relative representation of the complexity of an algorithm. There are some important and deliberately chosen words in that sentence: relative: you can only compare apples to apples. You can't compare an algorithm to do arithmetic multiplication to an algorithm that sorts a list of integers. But two algorithms that do arithmetic operations (one multiplication, one addition) will tell you something meaningful; re...
 1  1  notes

One of the best, down-to-Earth explanations of a concept that can get incredibly complex.