Quick Sort Complete Explanation and Implementation | Data Structures and Algorithms

[@arulprakasan1697]

you are really serving !! you must have a great future in teaching !! such a wonderful explanation without any confusions !! Thanks a ton !!

[@shrinaths5482]

great work mam ! Continue posting DSA and problem solving videos in Java !

[@LogicFirstTamil]

sure bro. pls share with ur friends and help me reach more students.

[@kousikraj4597]

am really saying, this is the best explanation for quick sort. Understood each and every step. Thanks for this video...

[@mathsmanju2197]

Supera puriuthu thank u what do you do sis How did u learn perfectly Who taught u From where u got such a clear knowledge Amazing sister Very jealous of u

[@suryam_29]

Thank you madam, I planned to learn quick sort today. You also uploaded video thank you so much...... ,❤️❤️♥️

[@meenavinoth1293]

Data structure pls neraiya concept algorithm base Pani video podunga mam unga videoa matumtha nala understand pana mudiuthu mam so neraiya concept base Pani podunga

[@LogicFirstTamil]

Sure. I will do. Pls share with your friends.

[@ashwini6740]

good video, thank you for this. It would be great if you provide the code separately for reference.

[@suryam_29]

Madam, are you developer / professor? You are feeding a logic words by words super madam.....

[@resh0402]

Very nice, clear and detailed explanation mam. 😃👍. . Thanks for the efforts. .

[@ganeshnageswaran4808]

Thanks for your hardwork mam!! 🙏

[@krishnaveeran5556]

32:49 ultimate 😃after learning all sort

[@sanjaymuthulakshmi9867]

Mam needed to know about recursion relation time complexity please give a try to upload that mam✌

[@Kusumbu1997]

Super teacher 😇✌️

[@SamPrakashM]

very good Explantion mam

[@krishnamoorthi1549]

mam 29.25min la high value = -1 thana varum but high =1 nu iruku nama high = end thana vacherukom(para meter la) so high = -1 thana varanum

[@jegatheeshwaran7294]

Super akka

[@tomfred4030]

In 34:48 i can't get that question.Can you explain what question is?

[@gozmit7806]

❤❤

[@sathishg3636]

It show stack overflow exception

[@viswanathanr9873]

Mam DBMS video poduga plzzzz 🙏

[@rahim7631]

Mam ennaku first pass la [4,1,2,5,3] in tha array la "2" Pivot ah eduthan but 2 correct aana position la varala [2,1,4,5,3] ipdi varuthu

[@LogicFirstTamil]

program debugging or dry run? either way some mistake on ur side

[@saieswariamaran9003]

yes u are right, you will end up with [2,1,4,5,3] but you need to proceed further to the next recursion step, where this array will be split as [2,1][low=0, end=1] and [4,5,3] [start=2, high = 4], in that step the order gets arranged properly. for example for the first half [2,1], the pivot will be 2 (mid =0), so quick sort will shuffle it. In the second half [4,5,3] pivot will be 5 (mid = 3), again quick sort will sort it to proper places. Hope this helps.

[@rahim7631]

@@saieswariamaran9003 thank you bro... ☺😇

[@vimalsuku9452]

Mam git-hub le code eruka

[@kirubakaran1547]

Dsa mudinchuta illa innum irukka?

[@LogicFirstTamil]

neraya iruku

[@happinessforever6183]

Recursion relation venum ka

[@TamilMasterCreations]

Binary search and sort methods code ella

[@LogicFirstTamil]

I will add bro

[@TamilMasterCreations]

Ok

[@meenavinoth1293]

Mam neenga yena job poringa lecture ah mam

[@LogicFirstTamil]

I am not working currently sister.

[@mathsmanju2197]

Why such a perfect professor​@@LogicFirstTamil

[@navaneethan3830]

Python ?

[@LogicFirstTamil]

I have already uploaded. kzbin.info/www/bejne/eJqngJiepqxpbsk

[@r.m.anbarasu2489]

your coding have error!