Asymptotic Notation in Hindi | Big oh, big omega, theta, small oh, small omega notations
116.9 هزار بار بازدید -
5 سال پیش
-
Hii..... Today our topic is
Hii..... Today our topic is Asymptomatic Notation. In this video we discuss about the big O notations, big omega notations, theta notations, little omega notations, little o notations.
Asymptotic Notations are languages that allow us to analyze an algorithm's running time by identifying its behavior as the input size for the algorithm increases. This is also known as an algorithm's growth rate. ... Asymptotic Notation gives us the ability to answer these questions.
We use three types of asymptotic notations to represent the growth of any algorithm, as input increases: Big Theta (Θ) Big Oh(O) Big Omega (Ω) and two more little o and little omega.
The term asymptotic means approaching a value or curve arbitrarily closely (i.e., as some sort of limit is taken). A line or curve that is asymptotic to given curve is called the asymptote of . Hardy and Wright (1979, p. 7) use the symbol to denote that one quantity is asymptotic to another.
Hope you guys easily understood.
Thank you for watching
_______________________________________________
PLEASE LIKE SHARE COMMENTS AND SUBSCRIBE
_______________________________________________
Press the link below for more videos on algorithm design and analysis
Masters Theorem for solving recurrence
Master Theorem for Solving Recurrence...
Big O notation, prove n!= O(n^n)
Big oh notation | How To Prove n! = O...
Asymptotic notation, big Oh, big omega, theta notations
Asymptotic Notation in Hindi | Big oh...
Properties of asymptotic notation, how to calculate time complexity
PROPERTIES OF ASYMPTOTIC NOTATIONS ||...
Substitution Method for solving any recurrence
SUBSTITUTION METHOD FOR SOLVING ANY R...
Bubble sort algorithm, calculation of it's time complexity
BUBBLE SORT IN HINDI || ITS ALGORITHM...
Selection sort algorithm, calculation of its time complexity
SELECTION SORT IN HINDI || ALGORITHM ...
For watch more tutorials pls visit the playlist in the channel
channel: @startpracticing
playlist of algorithm design and analysis
Algorithm design and analysis
playlist of operation research
Operation Research In Hindi || Comput...
Playlist of Transportation Problem
Transportation problem in operation R...
playlist of probability for engineering mathematics
Probability (engineering Mathematics)
asymptotic notation, asymptotic notation in hindi, asymptotic analysis, Asymptomatic Notation in data structure, asymptotic notation algorithm analysis, asymptotic notation in daa, asymptotic analysis of algorithm, asymptotic notation in algorithm, asymptotic notation in design and analysis of algorithm, big o notations, big omega notations, theta notations, little omega notations, little o notations
Asymptotic Notations are languages that allow us to analyze an algorithm's running time by identifying its behavior as the input size for the algorithm increases. This is also known as an algorithm's growth rate. ... Asymptotic Notation gives us the ability to answer these questions.
We use three types of asymptotic notations to represent the growth of any algorithm, as input increases: Big Theta (Θ) Big Oh(O) Big Omega (Ω) and two more little o and little omega.
The term asymptotic means approaching a value or curve arbitrarily closely (i.e., as some sort of limit is taken). A line or curve that is asymptotic to given curve is called the asymptote of . Hardy and Wright (1979, p. 7) use the symbol to denote that one quantity is asymptotic to another.
Hope you guys easily understood.
Thank you for watching
_______________________________________________
PLEASE LIKE SHARE COMMENTS AND SUBSCRIBE
_______________________________________________
Press the link below for more videos on algorithm design and analysis
Masters Theorem for solving recurrence
Master Theorem for Solving Recurrence...
Big O notation, prove n!= O(n^n)
Big oh notation | How To Prove n! = O...
Asymptotic notation, big Oh, big omega, theta notations
Asymptotic Notation in Hindi | Big oh...
Properties of asymptotic notation, how to calculate time complexity
PROPERTIES OF ASYMPTOTIC NOTATIONS ||...
Substitution Method for solving any recurrence
SUBSTITUTION METHOD FOR SOLVING ANY R...
Bubble sort algorithm, calculation of it's time complexity
BUBBLE SORT IN HINDI || ITS ALGORITHM...
Selection sort algorithm, calculation of its time complexity
SELECTION SORT IN HINDI || ALGORITHM ...
For watch more tutorials pls visit the playlist in the channel
channel: @startpracticing
playlist of algorithm design and analysis
Algorithm design and analysis
playlist of operation research
Operation Research In Hindi || Comput...
Playlist of Transportation Problem
Transportation problem in operation R...
playlist of probability for engineering mathematics
Probability (engineering Mathematics)
asymptotic notation, asymptotic notation in hindi, asymptotic analysis, Asymptomatic Notation in data structure, asymptotic notation algorithm analysis, asymptotic notation in daa, asymptotic analysis of algorithm, asymptotic notation in algorithm, asymptotic notation in design and analysis of algorithm, big o notations, big omega notations, theta notations, little omega notations, little o notations
5 سال پیش
در تاریخ 1398/09/09 منتشر شده
است.
116,958
بـار بازدید شده