Step Count Method to Measure Time Complexity of an Algorithm - Part 1

This video explains how to derive the time complexity of an algorithm using step count method.
Frequency Count method
Time complexity of a loop
Analysis of algorithms with loops
Sum of all elements in an array
Measure time complexity of loop using step count method

Chapters:
0:00 What is the step count method ?
0:50 Algorithm to find sum of elements in an array
1:58 Calculate time complexity
3:03 Step 1: Find cost of each step on an algorithm
3:19 Step 2: Find the frequency of each step
4:12 Calculate the time complexity of assignment statement
4:59 Calculate the time complexity of the for loop
6:51 Calculate the time complexity of the body of for loop
7:17 Calculate the time complexity of the return statement
7:46 Calculate the total time complexity of the given algorithm

[carolina-dsun]

how is it that nobody wants to explain it as perfectly as this...

[vclarke]

I've been searching for a clear and concise explanation and I've found it

[macccabes]

This is by far the best explanation. Thank you so much!!

[TheExiledTexan]

Easily one of the finest overviews of this topic on YouTube.

[triumphyale]

All steps are very clear ! Hope you can make more videos and help the programming beginners !

[gurnoorsingh]

Finally someone explained it properly .thanks man

[syawwie]

thank you very much, i now have clearer understanding for this part.Helped me a lot in my discrete structure subject!

[tarundas]

Really the best explanation I have found so far . Thanks a lot Sir.

[zignd]

Your explaination was great, thank you very much sir!

[akash.mahajan]

Very precise and clear explanation. Thank you sir 🙏

[duddikuntavamsi]

Easy to understand tq soo much for your explanation sir

[venkateshdec]

A small correction in your explanation. The FOR loop of course run for N time. The reason for (N+1) is the initialization of i variable take the frequency of 1 time. So the total frequency of loop will be (N+1). The comparison (i<N) executes N times not at the last time. Actually there is no need of 2 parameters for this function. This may not work as expected if you pass like sum([1, 2, 3], 100). Instead of passing n as 2nd parameter, you can use arr.length for the place of N. Other than that awesome explanation. Looking for more videos.. Thumps up!

[jaganchowhaan]

I'm imagining myself in the position ..The way he taught was perfect.

[mithunshaha]

VERY GOOD TUTORIAL SIR.WE NEED MORE TUTORIAL FROM YOU

[arjun]

whats the difference between step count n freq count ? is c1 c2 ... necessary if we just want the time complexity??

[nothanks]

What would be the cost/frequency for declaration? Like if a statement is int a, b;

[garvbhatt]

should we write all steps say how it is arithmetic series etc or just the algorithm table and last calculation wil do in paper
any

[nageswarareddyakkala]

Sir I have doubt that why c3 is having n freq.but it is having two operations...

[hasibahmad]

Why you are not having more subscribers 😭😭😭