analysis of quicksort algorithm|quicksort time complexity analysis

[@infiziration5968]

waching 1 day before exam. thankyou for clear explanation, sir

[@SudhakarAtchala]

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

[@istutirajeev]

Thank You sir
Your hardwork rores in your words.
Really awesome and informative video.
This is the best Time complexity explanation on TH-cam

[@SudhakarAtchala]

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

[@obantikaroy9645]

Really appreciate your dedication. Thank you sir.

[@SudhakarAtchala]

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

[@ManishSahu-un3ct]

Sir you are sweating , salute to your dedication 👍🙏

[@SudhakarAtchala]

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

[@ManishSahu-un3ct]

@@SudhakarAtchala 🙏 subscribed and will recommend in my class 👍
Sir, Kindly try to take lectures on following topics
1. Compiler design
2. Embedded system
3. AI & Machine learning
4. Soft computing
5. Modeling & simulation
6. Cryptography & network security
🙏🙏🙏

[@harihardhik3293]

sir very intuitive way of explanation like it!

[@SudhakarAtchala]

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

[@vshl.updhya]

Best channel 👌❣️

[@SudhakarAtchala]

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

[@tamimdewan4111]

Respect For you sir 💓
The explanation was very helpful 💝

[@SudhakarAtchala]

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

[@fittube.7269]

sir please use fan , u put a lot of hardwork for students like us . thank you so much .

[@SudhakarAtchala]

We have AC, no problem.

[@parthibbhattacharya7466]

Excellent teaching. Thank you so much

[@SudhakarAtchala]

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

[@kampadupavani7762]

Thank you sir.. It's more informative

[@SudhakarAtchala]

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

[@PavithraRagulapadu-ms2vg]

The time complexity of merge sort and quick sort are same
Right

[@SudhakarAtchala]

qs in worst case Is O(n2). Please like the videos, subscribe to the channel, and share it with your friends. Thanks in advance.

[@bhaviAnirudh]

great effort

[@SudhakarAtchala]

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

[@ifkingdepressed]

sir what about avaerage case

[@SudhakarAtchala]

In q.s best and averge are same.Please like the videos, subscribe to the channel, and share it with your friends. Thanks in advance.

[@Sravani47peddi]

Good explanation sir tqu sir

[@SudhakarAtchala]

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

[@abritachatterjee1293]

best is youtube sir

[@SudhakarAtchala]

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

[@jagadeswarreddyreddam5637]

Superb sir

[@SudhakarAtchala]

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

[@keerthimahesh7570]

Thank you soo much sir 💟

[@SudhakarAtchala]

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

[@thumatibhavani9375]

Sir can you upload problems on time complexity?

[@SudhakarAtchala]

Refer ds playlist. There i uploaded t.c videos
th-cam.com/play/PLXj4XH7LcRfAhaLFnq4fQ5ASOqKd08-Us.html
Plz subscribe to the channel and if possible share with your friends. Thanks in advance..

[@JitendraYadav-ug1jw]

Hatts off sir 😊

[@SudhakarAtchala]

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

[@UdayKiranAkula]

Thank you sir ❤❤

[@SudhakarAtchala]

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

[@manishkumar-uw5mw]

Thanks a lot sir

[@SudhakarAtchala]

Welcome

[@ranjaniam8038]

good morning sir, you are taking the class superb.
sir but tell the concept slowly. pls

[@SudhakarAtchala]

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

[@divyaanshuagrawal3383]

Thanks sir!

[@SudhakarAtchala]

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

[@MohammedSameer-hf3su]

Awesome

[@SudhakarAtchala]

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

[@souravray2843]

Thank you sir

[@SudhakarAtchala]

Hai Sourav Ray, 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.

[@abdulaziz-vm7yh]

so same as merge sort?

[@SudhakarAtchala]

Best case and average case are the same. But worst case time complexity is O(n square). Plz subscribe to the channel and if possible share with your friends. Thanks in advance..

[@eziosan7208]

Same goes for merge sort.

[@SudhakarAtchala]

No, merge sort is different. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..

[@rsamhitha4707]

Thank you sir

[@SudhakarAtchala]

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