Notesale: Turn your study into money

Document Preview

Extracts from the notes are below, to see the PDF you'll receive please use the links above

---

404

Page not found
Go back to home

Best Case, Worst Case and Average Case Analysis of
an Algorithm (With Notes)
CodeWithHarry

K is an integer ) SO now I 'll write it like this K n ( K is an
integer ) So now I 'll write it Like this K n ( K is an integer ) So
now I 'll write it like this
...
The graph of ( n^2+n ) ; graph of n ;
graph of ( N^2+n ) will go below 2n
...
?" This passage discusses Algo 2, which is a
cunning person who is smart
...
Algo 2 says that he will
not make useless comparisons, and provides an example
...
Algo 2 first takes the first and
last element of an array, and then compares them
...
They
match, Algo 2 is good; if they don't match
...

The stack do at a particular time point?? SO
...
SO it will
go up to factorial 4 at that point in time, And then it will go
back down to factorial 3
...

algorithm will take time X on a computer with processor Y
...
SO
...

But
...
SO that is why I say the space complexity is O ( N )
...
space complexity is O ( n )
...
IT
states that the space complexity of the algorithm is O ( N ),
where n is the size of the input
...
This means that at any given
time, the algorithm will be able to fit in a maximum of three
stack frames
...
The algorithm calculates
in 10 seconds, and as input grows, so does the time it takes to
calculate
...

View Summary

How would you rate this summary?

😠😔😐👌😃
You rated:

Copy link to this summary



---