Time Complexity and Big O Notation (with
notes)
CodeWithHarry
So the input size didn't increase and the runtime of the
algorithms didn't increase either .No , it doesn't depend on the
size of the input . When we ask questions like as the input will
increase, Then the runtime will change as per what? And after
that Now you will go to aunty's house You will be treated.
Consider there are different routes to come and go.
I want to tell you guys one story. It happened like this , I was
bored in my house. I was so bored that I needed some
entertainment. This guy has amazing games like Pubg and
GTA5. So he has a collection of games. He likes playing games
a lot. And you can get every type of game from him. But there
is one problem , I also use jio. He also uses jio and we get just 1
Gb for one day. And with more internet , we ca n't sell files and
all. So for me , what is the fastest way to take the game from
this friend. So what will I do ? I will take my bike As the size of
this input will get increased, the runtime of the algorithms will
increase. This means that as the input size is increasing like
that The time required to send the file , That is also increasing.
There is a hard disk then there is your motorcycle. You will go
on that bike. And you will take it and in hard disk whether you
bring 250kb or Tb. As the input size of algo2 increased like
that what happened ? For that , there was no change in the
runtime. Runtime remained the same. So we say as the size of
the input keeps on increasing , Similarly, what is the effect of
the algorithm on runtime. We are to trying to remove the time
complexity of them.
is the algorithm that runs in constant time . K1 n to the power
0+k2+k3+k4 This time is required in algo 2 .The sentence is:
Run time of it, there are some things that we will recite.
Because we won't constantly use our brains again and again, as
notes)
CodeWithHarry
So the input size didn't increase and the runtime of the
algorithms didn't increase either .No , it doesn't depend on the
size of the input . When we ask questions like as the input will
increase, Then the runtime will change as per what? And after
that Now you will go to aunty's house You will be treated.
Consider there are different routes to come and go.
I want to tell you guys one story. It happened like this , I was
bored in my house. I was so bored that I needed some
entertainment. This guy has amazing games like Pubg and
GTA5. So he has a collection of games. He likes playing games
a lot. And you can get every type of game from him. But there
is one problem , I also use jio. He also uses jio and we get just 1
Gb for one day. And with more internet , we ca n't sell files and
all. So for me , what is the fastest way to take the game from
this friend. So what will I do ? I will take my bike As the size of
this input will get increased, the runtime of the algorithms will
increase. This means that as the input size is increasing like
that The time required to send the file , That is also increasing.
There is a hard disk then there is your motorcycle. You will go
on that bike. And you will take it and in hard disk whether you
bring 250kb or Tb. As the input size of algo2 increased like
that what happened ? For that , there was no change in the
runtime. Runtime remained the same. So we say as the size of
the input keeps on increasing , Similarly, what is the effect of
the algorithm on runtime. We are to trying to remove the time
complexity of them.
is the algorithm that runs in constant time . K1 n to the power
0+k2+k3+k4 This time is required in algo 2 .The sentence is:
Run time of it, there are some things that we will recite.
Because we won't constantly use our brains again and again, as
