Big O notation - Data Structures & Algorithms Tutorial #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, You will know how to find the time and space complexity of algorithms. Clarification: At 5:05, the code should be print(str(numbers[i]) + " is a duplicate"), to concatenate integer with string you need to convert to string or use format string. #bigo #bigonotation #timecomplexity #spacecomplexity #datastructures #algorithms #python Do you want to learn technology from me? Check https://resources.codebasics.io/93bFYo for my affordable video courses. Next Video:    • Arrays - Data Structures & Algorithms Tuto...   Previous video:    • Data Structures & Algorithms Tutorial in P...   Complete playlist:   • Data Structures And Algorithms In Python   🌎 My Website For Video Courses: https://resources.codebasics.io/93bFYo Need help building software or data analytics and AI solutions? My company https://www.atliq.com/ can help. Click on the Contact button on that website. #️⃣ Social Media #️⃣ 🔗 Discord:   / discord   📸 Codebasics Instagram:   / codebasicshub   🔊 Codebasics Facebook:   / codebasicshub   📝 Codebasics LinkedIn:   / codebasics   📱 Codebasics X handle:   / codebasicshub   📸 Dhaval's Instagram:   / dhavalsays   📝 Dhaval's LinkedIn:   / dhavalsays   📱 Dhaval's X handle: https://x.com/dpcodebasics 🔗 Patreon: https://www.patreon.com/codebasics?fa...