Last active
December 20, 2015 17:26
-
-
Save sandeepnmenon/3f37491490a1e98b8578 to your computer and use it in GitHub Desktop.
WEB CLUB WInter Mentorship : NOtes
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| 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: | |
| anandarao.h8@gmail.com | |
| mohitreddy1996@gmail.com | |
| menonsandu@gmail.com | |
| menonsandu@gmail.com |
O(nlogn) time complexity
http://ideone.com/mRhliT
merge sort :
http://ideone.com/XdeIk4
binary search :
http://ideone.com/zTF5ri
linear search :
http://ideone.com/9vtujE
factorial:
http://ideone.com/VitCv5
Factorial using recursion explained :
http://www.programiz.com/cpp-programming/recursion
Pascal's Triangle : http://ideone.com/veTegF
Prime Check: http://ideone.com/Sp58lL
Bubble Sort: http://ideone.com/wA6e7r
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
anandarao.h8@gmail.com
mohitreddy1996@gmail.com
menonsandu@gmail.com
Quick Sort Demo:
http://me.dt.in.th/page/Quicksort/
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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) );
}
http://ideone.com/DryMFV