Time Complexity Algorithm Analysis

Time Complexity Algorithm Analysis
★Please Subscribe !
/ @randerson112358
★Easy Algorithm Analysis Tutorial:
www.udemy.com/algorithm-analy...
★Recurrence Relation Made Easy: www.udemy.com/recurrence-rela...
►Tree Traversal Videos:
(1) Preorder: • Preorder Traversal
(2) Postorder: • Postorder Traversal
(3) Inorder: • Inorder Traversal
(4) Tree Traversal Example: • Tree Traversal Example
►Videos on Discrete Math Induction:
(1) Induction Summation: • Proof By Induction Sum...
(2) Mathematical Induction Divisibility: • Proof By Induction Div...
(3) Induction Recurrence Relation 1: • Recurrence Relation Pr...
(4) Induction Recurrence Relation 2: • Recurrence Relation Ru...
►Videos on Logical Equivalence:
(0) Logical Equivalence: • Prove Logical Equivale...
(1) Tautology: • Truth Table Tautology ...
(2) Tautology: www.youtube.com/watch?v=okZcT...
(3) Contradiction: www.youtube.com/watch?v=YXSYB...
►Videos on Big-O Asymptotics:
(1)Solve Big O: • Solve Big-O By Definition
(2)Solve Theta: • Prove Big Theta
(3)Solve Big Omega: • Prove Big Omega
(4)Big O Notation Explained: • Big O Notation Explained
►Summation Videos:
Closed Form Solution Summation: • Closed Form Solution S...
Algorithm Analysis Summation: • Algorithm Analysis and...
Summation / Sigma Notation: • Summation / Sigma Nota...
Summation Closed Form Solution: • Summation Closed Form ...
Evaluate The Summation: • Evaluate The Summation
Time Complexity of Code using summations: • Time Complexity of Cod...
►Recurrence Relation Videos:
Recurrence Relation Proof by Induction: • Recurrence Relation Pr...
Recurrence Relation Run Time by Induction: • Recurrence Relation Ru...
Recurrence Tree: • Recursion Tree Method ...
►Big O, Big Omega, Big Theta Limit Videos:
(1) Solve Big Omega by Limits:
• Solve Big Omega By Limits
(2)Solve Big O by Limits:
• Solve Big-Oh By Limits
(3) Prove Little-o By Limits:
• Little o Proof Using L...
(4) Solve Big Theta By Limits:
• Solve Big Theta By Limits
♥ Visit My Website:
everythingcomputerscience.com/
♥Support this channel on Patreon:
/ randerson112358
♥Helpful Books:
►Algorithm Analysis Books:
www.amazon.com/gp/product/026...
►Discrete Mathematics Workbooks:
(1) Practice Problems In Discrete Mathematics - www.amazon.com/gp/product/013...
(2)Discrete Mathematics Workbook - www.amazon.com/gp/product/013...

[@wsanebvalley]

thanks a lot man. Keep it going. you way in explaining things is simple and straightforward

[@iloveihop07]

Excellent explanation, I have an algorithms class midterm today and this helped a lot!!

[@ayaalaswad1254]

That's perfect! Thank you for your efforts and your nice calming voice

[@aroojtayyaba.r]

wow wow wow i was stuck at this since last 2 lecs but now got ittt , THANK YOUUU !!

[@momilseedat8962]

thank u so much. finally i found the solution for my problem

[@chrisogonas]

WOW, that was rrrrrreally helpful. It opened up for me a whole class of problems. Thanks

[@imranrehmat9572]

Hi randerson,
Your videos are great and easy to understand. Can you please help me with the time complexity of maximum subsequence sum problem? Thanks in anticipation

[@andrewknowles55]

Dont usually bother leaving comments, but i havent done formal maths since i was 16 (8 years ago), and im currently studying for an msc in computer science. This video was absolutely invaluable, and you have an exceptional ability to explain things - thank you very much!

[@asrithnedurumalli5263]

You should've stayed off of comments

[@andrewknowles55]

@@asrithnedurumalli5263??

[@zkillerzjt6589]

Great explanation, good work

[@jamesbowen9347]

This is a good one thanks a lot

[@carolinarojano7298]

Really good explanation thanks

[@underhorse5367]

very helpful video, thanks

[@guillaume6373]

Cool!! Thank you, very helpful

[@user-od2cb9wt5x]

It's easier than my teacher's teaching

[@randerson112358]

Sometimes you just need either more information or a different perspective.

[@MetalGearBepis]

how do you know which summation formula to use?

[@sidyogendra5504]

This video didn’t make sense. At 3:08 doesn’t n= n-1 not i-1? And doesn’t m=3 not 0?

[@tunamusic2314]

how to convert (n^2-n-6)/2 to n^2, i don't understand :D

[@Stavroization]

a bit late but the reason is that -n-6 are insignificant in the scale of things. they don't do much to effect the overall complexity of the algorithm,

[@bigdogeyeballs5343]

1:57 I'm not sure why when you wrote i - 1 on top of the summation, you said it never reaches i. I didn't understand what you meant by it never reaches "i"? Is it because "i" is not included due to the condition having the "

[@richiebrad3182]

That’s basically it

[@c_20_dhanarajrk.54]

actually for i

[@mukeremmuhdinibnumuhdin2911]

❤❤❤❤❤❤❤

[@asrithnedurumalli5263]

I luv you

[@imranrehmat9572]

Hi randerson,
Your videos are great and easy to understand. Can you please help me with the time complexity of maximum subsequence sum problem? Thanks in anticipation