Design and Analysis of Algorithms

Design and Analysis of Algorithms

Neso Academy via YouTube Direct link

Formal Definition of Big O Notation

13 of 95
Previous
Next

13 of 95

Formal Definition of Big O Notation

Class Central Classrooms beta

YouTube videos curated by Class Central.

Classroom Contents

Design and Analysis of Algorithms

Automatically move to the next video in the Classroom when playback concludes
  1. 1 Introduction to Algorithms
  2. 2 Algorithm vs. Program
  3. 3 Characteristics of an Algorithm
  4. 4 Significance of Algorithms
  5. 5 Decidable vs. Undecidable Problems in Algorithms
  6. 6 The Nature of Undecidable Problems
  7. 7 Posteriori vs. Priori Analysis
  8. 8 Algorithms - Rapid Fire Quiz 1
  9. 9 Importance of Algorithm Analysis
  10. 10 Importance of Growth Rate
  11. 11 Introduction to Big O Notation
  12. 12 Big O Notation and Binary Search
  13. 13 Formal Definition of Big O Notation
  14. 14 Big O Notation (Solved Problems) - Set 1
  15. 15 Big O Notation (Solved Problems) - Set 2
  16. 16 Big O Notation (Solved Problems) - Set 3
  17. 17 Big O Notation (Solved Problems) - Set 4
  18. 18 Common Big O Runtimes
  19. 19 Functions in Asymptotic Notations (Decrement Functions)
  20. 20 Functions in Asymptotic Notations (Constant Functions)
  21. 21 Functions in Asymptotic Notations (Logarithmic Functions)
  22. 22 Functions in Asymptotic Notations (Polynomial Functions)
  23. 23 Functions in Asymptotic Notations (Exponential Functions)
  24. 24 Functions in Asymptotic Notations (Solved Problem 1)
  25. 25 Functions in Asymptotic Notations (Solved Problem 2)
  26. 26 Functions in Asymptotic Notations (Solved Problem 3)
  27. 27 The Big Omega (Ω) Notation
  28. 28 The Big Theta (θ) Notation
  29. 29 Big Omega and Big Theta Notations (Solved Problems)
  30. 30 Properties of Asymptotic Notations (General Property)
  31. 31 Properties of Asymptotic Notations (Reflexive Property)
  32. 32 Properties of Asymptotic Notations (Symmetric Property)
  33. 33 Properties of Asymptotic Notations (Transpose Symmetric Property)
  34. 34 Properties of Asymptotic Notations (Transitive Property)
  35. 35 Properties of Asymptotic Notations (Addition and Multiplication)
  36. 36 The Little o Notation
  37. 37 The Little Omega (ω) Notation
  38. 38 Asymptotic Notations - Summary
  39. 39 Asymptotic Notations (Solved Problem 1)
  40. 40 Asymptotic Notations (Solved Problem 2)
  41. 41 Asymptotic Notations (Solved Problem 3)
  42. 42 Asymptotic Notations (Solved Problem 4)
  43. 43 Asymptotic Notations (Solved Problem 5)
  44. 44 Asymptotic Notations (Solved Problem 6)
  45. 45 Algorithms - Rapid Fire Quiz 2
  46. 46 Understanding the Time Complexity of an Algorithm
  47. 47 Understanding the Space Complexity of an Algorithm
  48. 48 Analysis of Algorithms (Logarithms and Summations)
  49. 49 Time Complexity of Single Loops (Introduction)
  50. 50 Time Complexity of Single Loops (Increment by a Constant)
  51. 51 Time Complexity of Single Loops (Decrement by a Constant)
  52. 52 Time Complexity of Single Loops (Multiplying the Update Expression)
  53. 53 Time Complexity of Single Loops (Dividing the Update Expression)
  54. 54 Time Complexity of Single Loops (Update Expression with Power)
  55. 55 Time Complexity of Single Loops (Conditional Statement with a Function)
  56. 56 Time Complexity of Single Loops (Initialization Statement with a Function)
  57. 57 Time Complexity of Nested Loops (Independent Loops)
  58. 58 Time Complexity of Nested Loops (Independent Loop Examples)
  59. 59 Time Complexity of Nested Loops (Dependent Loops)
  60. 60 Time Complexity of Nested Loops (Dependent Loop Examples)
  61. 61 Time Complexity of Loops (Solved Problem 1)
  62. 62 Time Complexity of Loops (Solved Problem 2)
  63. 63 Time Complexity of Loops (Solved Problem 3)
  64. 64 Time Complexity of Loops (Solved Problem 4)
  65. 65 Time Complexity of Loops (Solved Problem 5)
  66. 66 Time Complexity of Loops (Solved Problem 6)
  67. 67 Algorithms - Rapid Fire Quiz 3
  68. 68 Space Complexity of Recursive Algorithms (The Call Stack)
  69. 69 Space Complexity of Recursive Algorithms (A Recursive Function)
  70. 70 Finding the Space Complexity of Recursive Algorithms
  71. 71 Space Complexity of Recursive Algorithms (Factorial of n)
  72. 72 Space Complexity of Recursive Algorithms (nth Fibonacci Number)
  73. 73 Space Complexity of Recursive Algorithms (Solved Problem 1)
  74. 74 Space Complexity of Recursive Algorithms (Solved Problem 2)
  75. 75 Space Complexity of Recursive Algorithms (Solved Problem 3)
  76. 76 Space Complexity of Recursive Algorithms (Solved Problem 4)
  77. 77 Algorithms - Rapid Fire Quiz 4
  78. 78 Writing Recurrence Relations
  79. 79 Substitution Method to Solve Recurrence Relation of Time
  80. 80 Substitution Method to Solve Recurrence Relation of Return Value
  81. 81 Substitution Method to Solve Recurrence Relation of Multiplications
  82. 82 Solving Recurrences using Substitution Method (Solved Problem 1)
  83. 83 Solving Recurrences using Substitution Method (Solved Problem 2)
  84. 84 Solving Recurrences using Substitution Method (Solved Problem 3)
  85. 85 Solving Recurrences using Substitution Method (Solved Problem 4)
  86. 86 Solving Recurrences using Substitution Method (Solved Problem 5)
  87. 87 Solving Recurrences using Substitution Method (Solved Problem 6)
  88. 88 Solving Recurrences using Substitution Method (Solved Problem 7)
  89. 89 Solving Recurrences using Substitution Method (Solved Problem 8)
  90. 90 Solving Recurrences using Substitution Method (Solved Problem 9)
  91. 91 Introduction to Towers of Hanoi
  92. 92 Towers of Hanoi (Recursive Algorithm)
  93. 93 Towers of Hanoi (Implementation)
  94. 94 Towers of Hanoi (Recurrence Relation of Moves)
  95. 95 Algorithms - Rapid Fire Quiz 5

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Sign up for free
Someone learning on their laptop while sitting on the floor.