This is the best explanation I have came acorss for quick sort ,crisp clear with keypoints for handling same locations of pivot and pointers giving all details like disadvantage of selecting first and last for sorted and reverse sequence
Hi M'am, This is excellent tutorial on quick sort. Your presentation of concepts is very clear and precise. Your voice is also crystal clear in its diction. The timestamp 16:07 at which you say - '17' is sorted' makes the whole sorting algorithm very clear. This is sheer brilliance. I have subscribed. Thanks.
@amulyasAcademy -- super, super, SUPER!! your mind works like a computer, methodical and clear instructions and steps... I learnt a good deal of subject with this lesson!! Thanks !!
your teaching is great but could you pick up the pace a bit, we are not nine-year-olds, I am watching your videos on 2x,other than that everything is great,keep it up.
This is the best explanation I have came acorss for quick sort ,crisp clear with keypoints for handling same locations of pivot and pointers giving all details like disadvantage of selecting first and last for sorted and reverse sequence
Hi M'am,
This is excellent tutorial on quick sort. Your presentation of concepts is very clear and precise. Your voice is also crystal clear in its diction. The timestamp 16:07 at which you say - '17' is sorted' makes the whole sorting algorithm very clear. This is sheer brilliance. I have subscribed. Thanks.
Superb teaching mam saheba.Respect and love from pakistan
Thank you :)
thanks for this video ,I was waiting for that video for a long time.
Sorry for the delay:)
@@AmulsAcademy mam why can't I use bubble sort or other sort bcs quick sort is extremely complicated .
@amulyasAcademy -- super, super, SUPER!! your mind works like a computer, methodical and clear instructions and steps... I learnt a good deal of subject with this lesson!! Thanks !!
Literally I have exams on tomorrow .I was searching for a proper explanation and finally I got it.Thanks alot 😀
If we already have inbuilt function sorted () in Python then why we are doing this complex algorithms??
In CP you can't apply in all problem inbuilt function. And from another perspective of the interview also.
Bcoz of everything matters for time complexity and the way of logic you are applying to do the problem
I can't thank you enough
ThankYou
Can you please explain why for last element as pivot, we need to swap pivot with left?
MAM,How recursion works in tower of Hanoi problem.Please explain
Will make a video :)
mam ur voice is just killing us ,pls make a video with your face 😊,it will be better to understand for students with face expression🔥
hey... brp please complete the playlist of algorithm
Mam, how we will write code (quick code ) in Python.
& Thankuu
firstly you need to understand the concepts(problems) well.
Clear basic programming knowledge.
Some practice.
:)
@@AmulsAcademy Mam your voice is very smooth & thankuu mam for time to time uploaded Python progrmming videos .
OK mam , practice makes Bette to best.
:)
ma'am plz make video on tim sort also
I will try :)
@@AmulsAcademy thanks ma'am
Plzz mam make a video on binary search in python
Sure:)
Hi, can u tell me what is the time complexity for the code that u have written using this logic?
she didn't write the code in this video 😒
mam, why we need quick sort ?
It is one of the best sorting algorithm when we are dealing with huge nUmber of items :)
my python code is not running
shorter format pls
may i expect django
from u
it is highly recommended to equalize your voice pitch... it hitting in our head..... otherwise, It's fine.
your teaching is great but could you pick up the pace a bit, we are not nine-year-olds, I am watching your videos on 2x,other than that everything is great,keep it up.