1.1. Analysis of Algorithm | Data Structures and Algorithms in Python | DSA Series
Hello Coders,
Here in the video, I have explained Analyzing Algorithms. Asymptotic Notations and Order of Growth.
The Complete timeline is as follows...
🕒 00:00 - Intro
🕒 00:11 - Contents
🕒 00:37 - Introduction
🕒 05:55 - Examples on Calculating Time Function
🕒 18:03 - Order of Growth
🕒 23:43 - Mathematical Approach to find Order of Growth
🕒 26:40 - Direct Approach to find Order of Growth
🕒 28:55 - Asymptotic Notation
🕒 31:06 - Big Oh - Notation (O)
🕒 38:20 - Big Omega - Notation (Ω)
🕒 42:00 - Theta Notation (Θ)
🕒 55:17 - Assignment in Analysis of Algorithm
🕒 56:11 - Graph of Big Oh, Big Omega, and Theta Notation
🕒 57:14 - Outro
Links:
[1] Interview of Former President Barak Obama at Google
• Barack Obama - Computer Science Question
[2] Wikipedia Link for Analysis of Algorithm
https://en.wikipedia.org/wiki/Analysi... -- Read 1st Paragraph
[3] Material - Analysis of Algorithm
{DOC} - https://docs.google.com/document/d/1R...
{PPT-PDF-with_Annotations} - https://drive.google.com/file/d/1oXUw...
{PPT-without_Annotations} -
https://docs.google.com/presentation/...
Practice Hard...
Thanks.
Stay Connected... (can also send doubts on)
Twitter: / harsh_23_07
Instagram: / codeakey
LinkedIn: / harsh-jaiswal-8a3087114