Asymptotic notation | Big-O notation | Design & Algorithms | Lec-9 | Bhanu Priya

preview_player
Показать описание
big o notation asymptotic analysis with example
Рекомендации по теме
Комментарии
Автор

It is very useful for every computer Engineering students👍👍👌👌👍👍

abhishekhingale
Автор

Mam, can we take upper bound as any number that may be greater than lower limit, except 4 like 5, 6 anything??

elizabasnet
Автор

We cannot assume c=4. We get the value of c by substituting n as 1. Then only we get c as 4

angadpalsingh
Автор

Hello, Your teaching is great. I understood lot of things

kindkumar
Автор

Ma'am why we have take the value of n ≥2 in big oh notation.
But why we have not start the value of n from 1 in "O" notation

mayankpal
Автор

Hii your all videos are awesome... But I have some suggestion for you ... Surly it's completely up to you ... My suggestion is please use white Bord and marker on the place of papers and pen...it save lot of papers and money...thanks for reading this ....

anshparihar
Автор

Hello, I have a question,
Why sin(1/x) = O(1), O = big-Oh?
I think sin(1/x) does not have a limit as x approaches to 0

mohammadghani
Автор

how to find the value of c suppose the function is f(n)=n!

naumanbagwan
Автор

Why you assume c=4 directly??
It can be 1, 2, 3 also
Any valid reason for jumping direct 4 value??

risavsur
Автор

last me apne gagalt kr diya, , , h check it at the time of proof, you the change the greater than symbol, and does not clearly proof it, , , ,

alokguptatech
Автор

It's purely educational oriented explaination.. not a real time explaination

AbB-shri
Автор

How many mathematical notation in data structure?

Mam pls replyy

twinklegarg
Автор

The condition which you make is wrong

you write 3n+2<=4n according to eq 1 it is wrong

isaidalishah
Автор

Dear ma'am, solve the equation of upper bound f(n) =lg(n2) +n2lg(n). Give me answer!!!

mitulkhokhar