Search for notes by fellow students, in your own course and all over the country.
Browse our notes for titles which look like what you need, you can preview any of the notes via a sample of the contents. After you're happy these are the notes you're after simply pop them into your shopping cart.
Document Preview
Extracts from the notes are below, to see the PDF you'll receive please use the links above
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
...
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
...
I want to tell you guys one story
...
I was so bored that I needed
some entertainment
...
So he has a collection of games
...
And you can get every type of game
from him
...
He also
uses jio and we get just 1 Gb for one day
...
So for me , what is the
fastest way to take the game from this friend
...
This means that as the input size is increasing like that
The time required to send the file , That is also increasing
...
You will
go on that bike
...
As the input size of algo2
increased like that what happened ? For that , there was
no change in the runtime
...
So
we say as the size of the input keeps on increasing ,
Similarly, what is the effect of the algorithm on runtime
...
is the algorithm that runs in constant time
...
The
sentence is: Run time of it, there are some things that we
will recite
...
Now,
come here and listen to another story
...
If the game is of N kb then how much time will you
need? The sentence is: Run time of it, there are some
things that we will recite
...
There are
also algorithms that are not linear in time