Analysis of Algorithms | Tanmay Varshney | Skillshare
Play Speed
  • 0.5x
  • 1x (Normal)
  • 1.25x
  • 1.5x
  • 2x
23 Videos (2h 46m)
    • Promo

      2:07
    • What is Algorithm?

      3:56
    • Properties of Algorithms

      2:04
    • Goal of Analysis of Algorithms

      2:22
    • Time Complexity

      6:10
    • Space Complexity

      3:43
    • Analysis of Basic Statements

      16:03
    • Comparison of Algorithms

      5:20
    • Order of growth

      6:30
    • Cases of Algorithms

      5:04
    • Asymptotic Notations

      6:39
    • Big O Notation

      14:46
    • Omega Notation

      13:25
    • Theta Notation

      10:46
    • Recursion

      6:50
    • Recurrence Relations

      8:21
    • Divide & Conquer

      5:07
    • Solving Recurrence Relations

      1:43
    • Types of Recurrence Relations

      5:21
    • Substitution Method

      8:53
    • Recurrence Tree Method

      8:57
    • Master Theorem

      10:39
    • Master Theorem - Examples

      11:14

About This Class

Be an EXPERT in analyzing algorithms & boost your software career.

This course is well-structured into a curriculum of 20+ video lectures, a wide variety of practical examples practice worksheets to test your understanding.

The curriculum focuses on the following topics:

  1. Basics of Algorithms: All you need to know about algorithms before learning to analyze them.

  2. Time and Space Complexity: These are the major factors on which the efficiency of your algorithm depends.

  3. Types of Analysis: Different situations while analyzing an algorithm which are Worst Case, Average Case & the Best Case.

  4. Asymptotic Notations: The industry standard adopted worldwide for notifying algorithms majorly Big-O Notation, Omega Notation & the Theta Notation.

  5. Important Algorithmic paradigms such as Recursion, Divide & Conquer which you will come across heavily while solving a coding problem whether in your academic curriculum or in your Interview.

  6. Recurrence Relations and all types of recurrence relations you will come across in all recursive problems.

  7. Solving Recurrence Relations: using Substitution, Recursive Tree & Master theorem method.

Taking this course will also help you in your upcoming coding interview.

18

Students

--

Projects

  • --
  • Beginner
  • Intermediate
  • Advanced
  • All Levels
  • Beg/Int
  • Int/Adv

Level

Community Generated

The level is determined by a majority opinion of students who have reviewed this class. The teacher's recommendation is shown until at least 5 student responses are collected.

Tanmay Varshney

Software Developer, Math Tutor

I am working as a Software Developer. I am a Math Enthusiast too. I have been graduated in Computer Science (Major) along with Mathematics (Minor). During my experience in IT industry and graduation, I found out that Mathematics plays a pivotal role whether it is algorithmic coding or solving business related and real life complex problems. So, I am really passionate about sharing my knowledge in Mathematics to anybody who has a desire to learn and apply their Math Knowledge in numerous field...

See full profile

Report class