3.2 Small o notation | small omega notation | asymptotic notations in Algorithms
in this video i will be discussing about
what is Small o notation?
what is small omega notation ?
Difference between small omega and big omega
Difference between small o and big o
what is theta notation?
what are lowerbounds?
what are upperbounds?
what is best case time complexity?
what is worst case time complexity in algorithms?
what is average case time complexity in algorithms
what are asymptotic notations in Algorithms
-----------------------------------------------------------------------------------------------------------------------------------
Other playlist links
-------------------------------------------------------------------------------------------------------------------------------------
Data structure playlist link
• Hashing | Introduction to Hashing in Datas...
Computer architecture playlist link
• Addressing modes | Addressing modes in Com...
C Programming playlist link
• Arrays | Need of Arrays | Array Declaratio...
Algorithms playlist link
• 1. Introduction to algorithms | Design and...
Theory of computation playlist link
• Push down automata | PDA | Theory of Compu...
--------------------------------------------------------------------------------------------------------------------------------------
Like us on facebook
/ cse-study-bytes-104950557855703
Follow us on Instagram
/ csestudybytes
Follow us on twitter
https://twitter.com/saquibulsabha?lan...
For suggestions please reach us at
[email protected]
---------------------------------------------------------------------------------------------------------------------------------------------