Big O notation - Data Structures & Algorithms Tutorial in Hindi #2 | Measuring time complexity

Big O notation is the way to measure how software program's running time or space requirements grow as the input size grows. We can't measure this using absolute terms such as time in seconds because different computers have different hardware hence we need a mathematical way to measure time complexity of a program and Big O is that mathematical way. The basic idea is to come up with mathematical function for a running time and consider only fastest growing term and discard other terms as well as constants. Big O is used to measure space complexity as well, #datastructures #algorithms #python Data structures course:    • Hindi Data Structures And Algorithms Tutor...   Codebasics English Channel:    / codebasics   #️⃣ Social Media #️⃣ 🔗 Discord:   / discord   📸 Instagram:   / codebasicshub   🌎 Website: 🔊 Facebook:   / codebasicshub   📱 Twitter:   / codebasicshub   📝 Linkedin (Personal):   / dhavalsays   📝 Linkedin (Codebasics):   / codebasics   ❗❗ DISCLAIMER: All opinions expressed in this video are of my own and not that of my employers'.