@. DATA STRUCTURE IN PYTHON - BIG O NOTATION смотреть онлайн

Easy way to learn data structures and algorithm programming in simple and easy steps using Python as a programming language.
Also includes the Syllabus of Classes XIth & XIIth.
--------------------------------------------------------------------------------------------------------------------------------------------------------------
Algorithm analysis refers to the analysis of the complexity of different algorithms and finding the most efficient algorithm to solve the problem at hand.
for efficient algorithm two main thing which we focus on:
1.time complexity
2. space complexity

Big-O Notation is a statistical measure, used to describe the complexity of the algorithm.
Big-O notation signifies the relationship between the input to the algorithm and the steps required to execute the algorithm.
The following are some of the most common Big-O functions:
Name Big O
Constant O(c)
Linear O(n)
Quadratic O(n^2)
Cubic O(n^3)
Exponential O(2^n)
Logarithmic O(log(n))
Log Linear O(nlog(n))

Space Complexity
In addition to the time complexity, where you count the number of steps required to complete the execution of an algorithm, you can also find space complexity which refers to the number of spaces you need to allocate in the memory space during the execution of a program.
------------------------------------------------------------------------------------------------------------------------------------------------------------

LINK RELATED PROGRAMS :https://github.com/saritaverma60/python-program
LINK FOR COMPLETE PLAYLIST :https://www.youtube.com/watch?v=8KdqmEmNrYA&list=PLNY8CSQ-shJMYBufq0yD9wvJsgqJfCStd
FACEBOOK LINK: https://www.facebook.com/Kundan-Tutorial-1927301307292166/?modal=admin_todo_tour

#Kundantutorial #bigonotatio #Algorith #datastructur #pytho #timecomplexit #spacecomplexity