Quicksort Time and Space Complexity | Quicksort Analysis | Best Case | Worst Case | GATECSE | DAA

[@Krish-su4oh]

underrated channel. I've found this guy's video more helpful, very logical and to the point.

[@paramn.pathak6036]

This channel is a gem, so many people do not know about this channel.

[@jeetm9603]

The way you explain things in simple and fluid way makes hard concept easy to understand. Thank you sir!

[@delta_mohit]

He is very underrated teacher. His way and understanding of concepts is amazing.

[@Top5786-h6v]

Sir hame complexity ka method bhi aana chaiye ya bs yaad karle for university exam point of yoh

[@THEGATEHUB]

Complexity ka method bhi anana chahiye. Kyunki kabhi kabhi exam main poocha jata hai

[@JohnCena-xz6nz]

@@THEGATEHUB sir complexity method samaj ne ke liye recurrence aana chayee?!

[@opshorts3205]

thnkssss sir for this quality content

[@JohnCena-xz6nz]

Average case ka kya sir?!

[@Sanskar810]

Hello sir!!...after completion of TOC playlist now I am following your CD Playlist....few days back I asked you about which remaining topics are not covered in the CD Playlist from GATE point of view....it will really helpful if you just list those topics here...so I could complete them..its a request... Awaiting reply....Thank you .!!!

[@THEGATEHUB]

Thanks a lot for your appreciation.. Please contact me through instagram.. I'd is given in the description of the Vedio..

[@haseebasif100]

love it

[@shadowgamer8105]

Sir T( n-1) ka 5:16 mein O(n) hoga sir

[@dilipmondal252]

O(n^2) hoga bro, Just use substitution method for T(n)=T(n-1)+n, you will get O(n^2)