Big O Notation | Big O Notation Explained with Examples | Time Complexity Data Structure & Algorithm

Опубликовано: 16 Январь 2025
на канале: Full Stack MoJo

4,406

Big O Notation or Time Complexity is the language we use to describe the complexity of an algorithm.

In this video, we will be exploring what Big O is, How to calculate Big O, Common Big O Functions, Big O Steps, Big O Rules, and much more.

Once you know the basic concepts, the same can be applied to every programming language like Java, Python, C++, JavaScript etc.

#BigO
#BigONotation
#TimeComplexity
#DSA
#DataStructuresAndAlgorithms
#InterviewEssentials
#ProgrammingInterview
#BigONotationExplained

▬▬▬▬▬▬ T I M E S T A M P S ⏰ ▬▬▬▬▬▬
0:00 - Course Intro & Course Overview
0:16 - What is Big O?
0:46 - Types of Algorithm Scenarios
1:21 - Rules to find Big O of an Algorithm
2:07 - How to calculate Big O
2:44 - Constant Time O(1)
3:14 - Linear Time O(n)
3:52- Quadratic Time O(n^2)
4:43 - Drop The Constants Rule 1
5:12 - Drop Less Significant Terms Rule 2
5:51- Step by Step Example
6:45 - Binary Search

▬▬▬▬▬▬ Want to learn more? 🚀 ▬▬▬▬▬▬
Learn Angular 11 in 40 Minutes ►    • Angular Tutorial For Beginners | Lear...
Learn React in 30 Minutes ►    • Learn React in 30 Minutes: React Basi...
Complete Angular Course ►    • Learn Angular From Scratch

▬▬▬▬▬▬ Connect with me 👋 ▬▬▬▬▬▬
FB group ►   / theartofcodingwithmohinish
LINKEDIN ►   / mohinishjoshi