Glad you liked it. Right now I haven't thought about making a complete course on dsa as I am still a student so that'll be difficult to manage however if you have any topic related to dsa where you are facing difficulties then do let me know...I'll definitely make videos on that:)
Why you take input from user for size of array ,you already give the size of arrays is 40.if some user give size 41 then your arrays take only data upto 40
In quick sort we first partition the array in such a way that all elements to the left of the pivot element are smaller, while all elements to the right of the pivot are greater that the pivot... So that's why we run these loop to sort the elements... Hope this will clear your doubt or you can check the video where I explained logic of quick sort... You can find the link in the description box.
mam can you please explain the 7th and 8th line of code??? I am super confused with those declarations of first and i.....I mean to say that pivot is storing the first index value but also i ?????? It will be very much helpful if someone explain that please please plzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz
Yes, we store the value of variable 'first' in both pivot and i then according to the conditions elements stored at index i and j will get swapped and they come in proper arrangement then value of pivot will change...This will happen till all the elements get sorted. Hope it will make your doubt clear but still if you are getting any doubts you can check out the video where I explained logic of quick sort. You can find the link in the description box.
We need to compare elements present at that index so that we can arrange elements in such a way that all elements to the left of the pivot element are smaller, while all elements to the right of the pivot are greater that the pivot... So that's why we run these loop to sort the elements... Hope this will clear your doubt or you can check the video where I explained logic of quick sort... You can find the link in the description box
One of the toughest topic cleared with good teaching skill.
Aap bhut achaa pdhati hai mam thanku
mam this is a best video on the internet i guess .100 percent clear now .
please start data structures course , your teaching is amazing
Ma'am plz make a video on heap sort, Bucket sort and Counting Sort🙏🏻🙏🏻 your videos are really a great assistance✨
Verrryyyy easily explained! Thanks a lott
Kya explain kiya hai, maza aya, superb✌
Woaahhhh this teaching is btr than DSU staff teaching
thank you mam for this video its very helpfull for me hatoff keep it up 👍👍
perfect explanation mam 😄😄
shouldnt it be a[j]>=a[pivot] line 14 of the code
very nice keep it up ✨
Great work mem☺
Expecting some interesting programmes
Good Explaination
great work..happily subscribed
Mam, please start a dsa course
U are a superb teacher.
Glad you liked it. Right now I haven't thought about making a complete course on dsa as I am still a student so that'll be difficult to manage however if you have any topic related to dsa where you are facing difficulties then do let me know...I'll definitely make videos on that:)
@@EdurisePoint thanks a lot mam
Mam you are chitter because you can get 0 in insert because compiler error output is started with 0
Thank you so much ❤️
love voice thank you so much madam
Plz Plz Plz 🙏Start whole Data structure courses
Nice working 💯
Thank you mam
Great work👌👌
Expecting some interesting programmes
Thank you
Keep watching and sharing 😊
That's a great fucking explanation! Thanks :D
Which compiler u are using dear
thanks madam thank you so much madam...
Great teaching skill
Roses are red
Violets are blue
The title is in English
The video should too
haha
Why you take input from user for size of array ,you already give the size of arrays is 40.if some user give size 41 then your arrays take only data upto 40
Whatever you written in compiler. Please give that in description also. That code.
Thanks a lot.🙏🙏🙏
Which software are you using for coding.
Please start a data structures and algorithm ....
Nice 🥰
Thanks for this video
Can u tell me please why a[j]>a pivot
In quick sort we first partition the array in such a way that all elements to the left of the pivot element are smaller, while all elements to the right of the pivot are greater that the pivot... So that's why we run these loop to sort the elements... Hope this will clear your doubt or you can check the video where I explained logic of quick sort... You can find the link in the description box.
Thank you 😊
Ma'am segmentation fault aa raha h
do u have comments for your program (or translation) ? (i don´t understand your language, i have to describe the commands)
mam can you please explain the 7th and 8th line of code??? I am super confused with those declarations of first and i.....I mean to say that pivot is storing the first index value but also i ?????? It will be very much helpful if someone explain that please please plzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz
Yes, we store the value of variable 'first' in both pivot and i then according to the conditions elements stored at index i and j will get swapped and they come in proper arrangement then value of pivot will change...This will happen till all the elements get sorted. Hope it will make your doubt clear but still if you are getting any doubts you can check out the video where I explained logic of quick sort. You can find the link in the description box.
✅✅✅❤️🤗
great work
Keep watching and sharing 😊
thank you
Different between bubble sort & quick sort
💜
Hello mam please upload a vedio on "program for radix sort".
Thanks mam
Please make more video
this is the first Indian girl I hear speaking
Nice
Keep watching and sharing😊
Mam, Could you please provide source code of it ?
What language are you speaking and why do all the English comments here seem to understand it lol
U have missed (j>=first) in third while loop
U may correct us...not to leave our problem!!!!
where should I write it?
We need to compare elements present at that index so that we can arrange elements in such a way that all elements to the left of the pivot element are smaller, while all elements to the right of the pivot are greater that the pivot... So that's why we run these loop to sort the elements... Hope this will clear your doubt or you can check the video where I explained logic of quick sort... You can find the link in the description box
This program is not working 👎
I cant understand anything sorry,
Vidio not clear
Where is the error
Total waste of time this code shows wrong output 😒
Bhai thik se check karo🙏
Nice
Keep watching and sharing 😊
Nice
Keep watching and sharing 😊