Big O Notation

http://install4install.com

 

Fig 1: Big O Notation

Fig 1: Big O Notation

 

Example 1

Example 2

2n2 + 4<=3 *n

4<=n

n=2 and n=-2,negative value is neglected.

Example 3

Example 4

Complexities of algorithms

The various big 0 complexities are given in Fig 2 and Fig 3.

Screen Shot 2014-07-25 at 6.27.09 PM

Fig 2: Complexities of sorting algorithms

Screen Shot 2014-09-11 at 12.56.46 PM

Fig 3 : Complexities of sorting algorithms

 

 

 



Short URL: http://tinyit.cc/e988e7
Author: Cusp2207 on July 26, 2014
Category: Algorithms, Computer Science
Tags:

Leave a Reply

Last articles