frequency count method to calculate Time Complexity of an Algorithm|step count method | DS | DAA

#frequencycountmethod #stepcountmethod #datastructureslectures
Frequency count (or) Step count:-
It denotes the number of times a statement to be executed.
Generally count value will be given depending upon corresponding statements.
• For comments, declarations the frequency count is zero (0).
• For Assignments, return statements the frequency count is 1.
• Ignore lower order exponents when higher order exponents are present.
• Ignore constant multipliers.

[@shreyanayak4283]

That Innocence in your face and eyes.. ☺Sir Thank you sooo much for this video... It helped me a lot
.. I'm Grateful for you 🙏🙏🙏

[@SudhakarAtchala]

So nice of you. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..

[@gantasalasaivasanth6512]

First of all, I am getting mad regarding time complexity for the past few days because of ur lecture before of exam it really makes a smile on my face, tq very much sir

[@SudhakarAtchala]

All the best. Plz subscribe to the channel and if possible share with your friends. Thanks in advance...

[@kritikasurana4997]

you are the best teacher sir...thanks for making this topic easy

[@SudhakarAtchala]

You are most welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.

[@mdzikrullah9575]

I Saw many videos but didnt got the concept.Thankyou so much sir for you super explanation.
Pls keep making such videos.

[@SudhakarAtchala]

Hai Mohmmed Zikrullah, plz go through my playlists once. Definitely you will like more videos. Thanks
for your encouragement and support towards our channel. Share my sessions with your friends and subscribe to our channel.Keep on following my sessions. Thank you so much.

[@bireshwardeb5464]

Thanks for all the wonderful videos sir!

[@SudhakarAtchala]

Glad you like them! Plz subscribe to the channel and if possible share with your friends. Thanks in advance..

[@clashharsha6430]

legend of Indian online teaching

[@SudhakarAtchala]

Oh, thanks. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.

[@prensudangol1547]

thank u sir i understood the complexities for the very first time

[@SudhakarAtchala]

Welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..

[@chebroleudaykiran3772]

i Saw many videos but didnt got the concept.Thankyou so much sir for you super explanation.tq sir

[@SudhakarAtchala]

Welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.

[@dharshinipk7903]

I Saw many videos but didnt got the concept.Thankyou so much sir

[@SudhakarAtchala]

Welcome Darshini. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.

[@MonikaJ-gl5bk]

crystal clear explanation sir 😄

[@SudhakarAtchala]

All the best. Please like the videos, subscribe to the channel, and share it with your friends. Thanks in advance.

[@LokeshPilli92]

Because of you i am getting interest on this subject. Thank you sir

[@SudhakarAtchala]

Welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.

[@killer3183]

Tech us in correct manner and clear my doubts thanks sir

[@SudhakarAtchala]

Welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.

[@Shorts-lb8ts]

You are doing a very nice effort for the video...Thank you so much sir

[@SudhakarAtchala]

It's my pleasure harsh. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.

[@hyderabadi_gamerz]

Excellent explanation sir😊😊

[@SudhakarAtchala]

Thanks and welcome. Please like the video, subscribe to the channel, and share it with your friends. Thanks in advance.

[@harshithdande2713]

Thank u sir, everything is clear.

[@SudhakarAtchala]

Always welcome

[@_a_r_un_]

Thanks for explaining so well, sir! 🔥

[@SudhakarAtchala]

Most welcome! Plz subscribe to the channel and if possible share with your friends. Thanks in advance..

[@Genius_Academy1444]

Thank you so much sir ❤
It cleared my whole doubt 🙏🙏🙏🙏

[@SudhakarAtchala]

Most welcome 😊. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..

[@Pavithraselvaraj205]

Thanks a lot sir ❤

[@SudhakarAtchala]

Most welcome. Please like the videos, subscribe to the channel, and share it with your friends. Thanks in advance.

[@dr.u.thirupalu9248]

Good teaching Sir

[@SudhakarAtchala]

Thanks and welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.

[@MoeUvaiz]

Thanks 🙏🏼

[@SudhakarAtchala]

You’re welcome 😊. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.

[@Madhavi_1177]

Super sir excellent teaching 🙏🙏

[@SudhakarAtchala]

Thanks. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.

[@avenger1898]

Sir really helpful sir , Thank you sir ,sir if possible make a video on recursion sum of time complexity sir ,please sir .. Thank you sir

[@SudhakarAtchala]

Okay. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.

[@amruthakaluva058]

really clear explanation sir❤

[@SudhakarAtchala]

Glad to hear that. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..

[@pkmkb-69]

simple and elegant thanks

[@SudhakarAtchala]

Welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.

[@vaishnaviyshastri5344]

Please teach software Engineering subject too sir !

[@bhuvan17175]

thanks a lot ❤❤

[@SudhakarAtchala]

Most welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance

[@kpavankalyan123]

Good explanation🎉

[@SudhakarAtchala]

Thanks. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.

[@lavanyanali7258]

Really nyc explanation sir

[@SudhakarAtchala]

Thanks and welcome. Plz subscribe to the channel and if possible share with your friends. Thanks

[@charlesantony9951]

Super thanks sir

[@SudhakarAtchala]

Hai Charles Antony, plz go through my playlists once. Definitely you will like more videos. Thanks for your encouragement and support towards our channel.Share my sessions with your friends and subscribe to our channel.Keep on following my sessions. Thank you so much.

[@hiranmai8478]

THANKYOU SO MUCH SIR

[@SudhakarAtchala]

Most welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..

[@akshitjasrotia9579]

very helpful...thanks

[@SudhakarAtchala]

Glad it was helpful Akshit. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.

[@bishwajeetpandey1570]

Very nice explanation

[@SudhakarAtchala]

Hai Vishwajeet Pandey Golu, plz go through my playlists once. Definitely you will like more videos. Thanks for your encouragement and support towards our channel.Share my sessions with your friends and subscribe to our channel.Keep on following my sessions. Thank you so much.

[@adonis9568]

In for loop i=0 is a initialization
And i++ will work n times
So total for loop will work
1 + n+1 + n
=2+ 2n
And
A statement a=b+c
There are 2 operations
So FC is 2
Why I am wrong??

[@shivanikumaricse_2127]

Thank you sir🙏

[@SudhakarAtchala]

Welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.

[@mandardesai9385]

very nice video sir👍👍💯

[@SudhakarAtchala]

Hai Mandar Desai, plz go through my playlists once. Definitely you will like more videos. Thanks for your encouragement and support towards our channel.Share my sessions with your friends and subscribe to our channel.Keep on following my sessions. Thank you so much.

[@544surekhakada8]

Please sir,continue the design and analysis of algorithms subject

[@SudhakarAtchala]

I will try my best Surekha. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.

[@harshithdande2713]

What is space complexity of simple for loop run for n times
having variables i and n.

[@SudhakarAtchala]

O(n)

[@pavankalyanbellamkonda1436]

nice explanation

[@SudhakarAtchala]

Plz subscribe to our channel and if possible share with your friends. Thanks

[@varunjojare]

Thank you

[@SudhakarAtchala]

You're welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance...

[@alekhyamadiraju6113]

how can we calculate time complexity of a recursive function using this frequency count or step count method??

[@SudhakarAtchala]

Just like iterative only, very soon upload a video on it. Please like the videos, subscribe to the channel, and share it with your friends. Thanks in advance.

[@deepaknaidu6552]

thank you, u made it super simple for me :P

[@SudhakarAtchala]

Welcome Deepak. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.

[@shaiksanam2984]

Sir for every question if they ask about space complexity and time complexity we can write this lecture

[@SudhakarAtchala]

for time complexity you need to explain 2 techniques such as frequency count and asymptotic notations (refer my ds playlist)and for space complexity refer my ds playlist.Plz subscribe to the channel and if possible share with your friends. Thanks in advance...

[@BCSKArulkumar]

Tq sir

[@SudhakarAtchala]

Welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.

[@technicaltips7293]

Thanks sir

[@SudhakarAtchala]

Hai , Thanks for your encouragement and support towards our channel.Share my sessions with your friends and subscribe to our channel.Keep on following my sessions. Thank you so much.

[@SudhakarAtchala]

Pls go through my data structures playlist once. Definitely you will like more videos. Thank you so much.

[@ajaybabu7886]

Sir ,Is Word count method and Frequency count method both are same sir

[@SudhakarAtchala]

As per my knowledge we have step count or frequency count. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..

[@abhishekpathak9654]

🔥🔥🔥

[@SudhakarAtchala]

thanks. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.

[@i_943_harshdeepkhartade9]

👌👌👍

[@SudhakarAtchala]

Thanks. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.

[@kuyabobss]

Thank you for the help :) why is that counting sort algorithm has a time complexity of O(n) even though it has 3 loops?

[@SudhakarAtchala]

Hai Paaaul, plz go through my videos once. Definitely you will like more videos. Thanks
for your encouragement and support towards our channel. Share my sessions with your friends and subscribe to our channel.Keep on following my sessions. Thank you so much.

[@kuyabobss]

@@SudhakarAtchaladefinitely yes, but canyou answee my question pls.

[@pangasrilakshmi4168]

In for loop we also have I=0 and j=0... assignment should also be given 1 then it must me 1+(n+1) isn't it...can you clarify

[@SudhakarAtchala]

Yes

[@SudhakarAtchala]

Hai Lakshmi, plz go through my videos once. Definitely you will like more videos. Thanks
for your encouragement and support towards our channel. Share my sessions with your friends and subscribe to our channel.Keep on following my sessions. Thank you so much.

[@rohitjadhav4451]

What is the time, space complexity of following code using frequency count method
for(i= 1; i

[@nepzel42069]

Thankyou sir you saved me from the exam.

[@SudhakarAtchala]

All the best. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.