WEB CLUB WInter Mentorship : NOtes

Time complexity and Basic Algorithms

big oh and time complecity : http://bigocheatsheet.com/
                           : http://www.studytonight.com/data-structures/time-complexity-of-algorithms
                           : http://web.mit.edu/16.070/www/lecture/big_o.pdf



Prime Check: http://ideone.com/Sp58lL

searcing algorithms : 
binary search : 
http://ideone.com/zTF5ri
linear search : 
http://ideone.com/9vtujE

Bubble Sort: http://ideone.com/wA6e7r

O(nlogn) time complexity
http://ideone.com/mRhliT

Factorial using recursion explained :   http://www.programiz.com/cpp-programming/recursion

factorial: 
http://ideone.com/VitCv5

Fibonacci recursion algo :
Recursice Fibonacci : 
int Fibonacci(int n)
{
if ( n == 0 )
return 0;
else if ( n == 1 )
return 1;
else
return ( Fibonacci(n-1) + Fibonacci(n-2) );
}



Pascal's Triangle : http://ideone.com/veTegF

merge sort : 
http://ideone.com/XdeIk4

divide and conquer algorithms :  http://www.radford.edu/~nokie/classes/360/divcon.html

Recursion : http://www.tutorialspoint.com/cprogramming/c_recursion.htm
          :  http://www.cplusplus.com/articles/D2N36Up4/ 


merge sort : 
http://ideone.com/XdeIk4

quick sort : http://geeksquiz.com/quick-sort/
http://ideone.com/PpUvXb
working of quick sort :  http://me.dt.in.th/page/Quicksort/

For further doubts contact:

[email protected]
[email protected]
[email protected]
[email protected]

Proof of exponential time complexity for recursive fibonacci function
http://stackoverflow.com/questions/360748/computational-complexity-of-fibonacci-sequence

For further doubts feel free to contact

[email protected]
[email protected]
[email protected]

Quick Sort Demo:
http://me.dt.in.th/page/Quicksort/