Finally I found quick short video which is most important on the earth 😁😁😁 nice explanation sir you are best ❤️❤️❤️ thankew for this kind of stuff
@ayushshukla1579
4 жыл бұрын
i want to give this video infinity likes. college wale 1 sem me ye ni smjha pae
@ripxjaws9973
2 жыл бұрын
I never used to comment buy yes im doin this coz its really understandable and ez and quick thnx sir ❤️
@mayanksaxena6321
2 жыл бұрын
finally, quick sort understood thank you, sir
@dhruvilsolanki9887
Жыл бұрын
HE IS MENTOR OF ALL MENTORS
@farukhshaik7991
3 жыл бұрын
Best explanation sir 😍😍
@purushkarlodhi4048
4 жыл бұрын
Tq sir Aapne bahut achhe se samjhaya
@Priya88888
4 жыл бұрын
Sir u made this concept very easy for us.... effective teaching
@sujeetsingh9838
3 жыл бұрын
Helpful video sir🙏🙏🙏❤️
@sougotasaha525
2 жыл бұрын
Please explain with algorithms.. It will be then become easier to relate the working with algos.. otherwise very fine teaching
@saadatkhanniazi
4 ай бұрын
Thank u so much sir 😊
@naveendubey4412
4 жыл бұрын
Excellent explanation sir
@sairamdonthula7827
4 жыл бұрын
Nice explanation bro
@mehulmodi6194
3 жыл бұрын
awesome explanation
@GAU-C--RATNAKANTAHANSE
3 жыл бұрын
Thank you sir...
@uniquelivestreamer6484
4 жыл бұрын
Thank you sir
@namitsharma3449
4 жыл бұрын
Thanks sir g 👍
@vinitasingh1117
4 жыл бұрын
Thank you sir, you are just awesome
@development295
Жыл бұрын
Thank sir
@nusratborsha3072
2 ай бұрын
best ❤
@kurapatiakhilkumar5314
4 жыл бұрын
description box me toh nahi hai koi bhi link
@sandrasamuel2132
2 жыл бұрын
Sir, if the array is scanned fully after each pass ,then it will be known that the array is sorted ,then the alorithm should be stopped..but why going to next pass? Please clear my doubt!!
@syedasiddiqui8036
3 жыл бұрын
Values agar pehlay bri ho phir chuti phir bri phir chuti ho tu esi terha krayn gayn phir
@shishirsaurav6428
2 жыл бұрын
bhai party 1 million
@shikhanigam649
4 жыл бұрын
How to choose pivot element and why we choose first element for pivot ..
@vashitvaraj8717
4 жыл бұрын
The answer to your question is that why do we choose A as the first alphabet in English alphabet. In short it is more convenient.
@rohitkumarrajoria6506
3 жыл бұрын
large number of elements k liye random element better hota h sir
@sheezanawaz476
3 жыл бұрын
Please gives lecture on pseudo code.
@mohdhasanrizvi759
2 жыл бұрын
Sir if q is equal to pivot element then what will we do ?
@navneetkaur1239
3 жыл бұрын
sir exam ma average case sa hi solve kra quicksort ko tu koi prob tu nhi ha plz tell
@sambusowmya7026
3 жыл бұрын
25,57,48,37,12,92,86,33 sir can u solve this one and make the vedio iam not getting this ans
@anupkhismatrao9280
10 ай бұрын
❤
@placementseries8066
3 жыл бұрын
What is the formula for number of comparisons for sorted array in quick sort?
@ankitamadiwal7306
4 жыл бұрын
Sir what if " p(infinity)
@hiramalik3057
4 жыл бұрын
infinity could not be less than pivot. because pivot is a fixed number and infinity is used for the purpose to stop at the condition p(infinity)>pivot always as infinity could not be less than a fixed number. In this case if p and q is crossed q and pivot will be interchanged.
@ankitamadiwal7306
4 жыл бұрын
@@hiramalik3057 thank you I got it very well
@no-body7286
3 жыл бұрын
previous video me app average case bola tha best case nahi
@shivangitripathi4196
8 ай бұрын
anyone can give this quick sort code
@VideoLanxer
4 жыл бұрын
Revision Best case and Average case's time complexity is N( Log N ) Worst case time complexity is 0(n^2)
@Coverfighter16
8 ай бұрын
kdd
@shrutiambashtha6196
4 жыл бұрын
Finally!! I learnt quick sort properly!!🥰 Thank u sir♥️
@mayurkalsekar524
4 жыл бұрын
Kya baat hai sir ,Maza aa Gaya . Sir aap Hindi me samjhate ho to bahut accha samajta hai.
@montysinghsingh827
4 жыл бұрын
Sir Very good Explanation i Did not get Bored when i study your lecture sir please can u also upload data structure and any programming language(c or java) tutorial it will help a lot
@harwinsingh1747
4 жыл бұрын
Thanks for covering all the subjects. Do you have any question bank available with you as well?
@TheIndian_22
3 жыл бұрын
Sir , pseudo code bhi daal dete
@golusahani9511
Жыл бұрын
Sir aap jio hazaro saal ye mare h aarzoo happy birthday to you🎉
@hitmanfan-45
Ай бұрын
00:02 Performance of quick sort depends on partition and pivot placement. 01:24 Quick sort worst case time complexity is crucial for competitive exams 02:37 Quick sort algorithm working with already sorted array. 03:40 Initial pass of Quick Sort algorithm explained 04:40 Explanation of partitioning in Quick Sort 05:36 Worst case time complexity of Quick Sort 06:34 Worst case of quick sort is O(N^2) 07:24 Worst case time complexity of Quick Sort is O(N^2)
@shivakarthikrathod2026
2 жыл бұрын
Great video, beautiful explanation Sir, thank you so much! :)
@sayandey8787
4 жыл бұрын
sir please upload the video binary search, heap sort , merge sort divide and conquer approach and their complexity .
@somopattnaik1243
3 ай бұрын
00:02 Performance of quick sort depends on partition and pivot placement. 01:24 Quick sort worst case time complexity is crucial for competitive exams 02:37 Quick sort algorithm working with already sorted array. 03:40 Initial pass of Quick Sort algorithm explained 04:40 Explanation of partitioning in Quick Sort 05:36 Worst case time complexity of Quick Sort 06:34 Worst case of quick sort is O(N^2) 07:24 Worst case time complexity of Quick Sort is O(N^2)
@mansikumari3917
Жыл бұрын
Sir what about the best case
@sakshamrocks9517
4 жыл бұрын
Sir, please Upload compliler design lectures also. It will going to help us a lot.
@SimranKaur-bf5nf
3 жыл бұрын
Hello sir please i need a fast solution for my quick solution problem please please 5,1,6,7,9,22,10,55,45,34
@vishaljhaveri6176
3 жыл бұрын
Quick Sort worst case time complexity =O(n^2)
@ShubhamMs-ms5qw
5 ай бұрын
Hello Sir, aapki videos bhot aachi h or bhot aacha pdhate ho. Bs aapko ek feedback dena chata hu ki video me aapki sound thori echo ho rhi h. Vse agre phone me sunte h to tik h pr jb headphone pr sunte h to echo aa rhi h agr echo nh hogi to kafi aacha lgega
@mohsinrahman4771
4 жыл бұрын
Bhaiya i am regular viewer, subscriber and sharer of all your videos..kindly upload videos of other subjects of computer science streams also. Thank you
@KajalSharma-lt3bq
8 ай бұрын
Thank you so much sir 🙏😊
@adityak935
3 жыл бұрын
Best explanation of quick sort ever😭😭😭🙏
@dulamshiva5340
3 жыл бұрын
thank you very much for the detailed explanation can i solve the above equation with Masters theorem method... response is highly appreciated
@nirahshaheen3994
3 жыл бұрын
Great video, beautiful explanation Sir, thank you so much! :)
@ZokhrafMalik
9 ай бұрын
sir with code smjhya keryin fr zaida achi smjh ayee gi 🥰
@mohitkaushik21
Жыл бұрын
Thanks sir 😊
@learningisfun3791
4 жыл бұрын
Sir quick sort stable sort hai ya instable sort
@smaxiso
4 жыл бұрын
Sir it will be really great if there will be a playlist of "Algorithms"
@rakshagupta1161
8 ай бұрын
Nice sir thanks a lot with great heartlly
@muhammadsalmansaeed9255
2 ай бұрын
didnt understood quick sort on my own, watched your video and now I can say, yess !! i know how to do it, Thanks for this amazing video !!!
@PrajapatKing098
Жыл бұрын
Apka concept bahut mast hai sir ... samjhane ke liye
@Usama2772
2 жыл бұрын
I am very confused with this question
@SanketSharmasanket7317
2 ай бұрын
awesome
@crashycreator
4 ай бұрын
this man is greater than all my university professors(teachers)
@animeshhazra6061
Жыл бұрын
Nice
@arichullai5626
3 жыл бұрын
Sir can you please help me with this sorting , using quick sort 9,15,10
@anjali_02
Ай бұрын
Aree wah sir i love you
@csea_37_shayoribhowmick53
Жыл бұрын
Worst case time complexity of Quick sort O(n^2)
@shubhammehta6239
2 жыл бұрын
Sir this is best or worst case complexity? As the video title it tells worst but u have explained best wala case
@sehrishramzan1463
3 жыл бұрын
Happy teacher day sir 🌸 Love nd respect from Pakistan 🇵🇰❤️
@parthtiwari2753
2 ай бұрын
How many people watching in 2024😊
@AisaBhagat25
12 күн бұрын
I am watching bro😂
@vobensingh8404
Жыл бұрын
Excellent 👍👍❣️❣️
@piyushanayak
Ай бұрын
Thankyou sir bhagwan apko khus rakhe🙏
@it19manmohanyadav27
3 жыл бұрын
Thanks sir
@jaydeeplakhani729
4 жыл бұрын
Thank god 😌 i successfully learn how to solve worst case... Thank you very much
@deepanshubhardwaj6951
8 ай бұрын
Sir thanks for sort message service for brain 👍🏻
@kewtomrao
3 жыл бұрын
Awesome explanation!!!
@illustratorbasics9202
Жыл бұрын
what if we select middle index as a pivot like we do in merge sort
@darshnadtak1765
3 жыл бұрын
could you please explain the Randomized quick sort?
@shilpimalaiya8265
2 жыл бұрын
Thankuhh sir finally I got this concept
@ShivamKumar-xm6vk
Жыл бұрын
Decreasing order k v bana dete n sir
@shraddhaathani7353
3 жыл бұрын
Amazing lecture ❤❤
@parneetkaur4444
4 жыл бұрын
thankuuuu☺☺
@satyarthranjan7025
9 ай бұрын
sir apne sorte array kyu liya hai
@afnanahmed4826
9 ай бұрын
To show worst scenario.
@322_pradiptachoudhury2
4 жыл бұрын
sir,please explain it by taking the last element as pivot
@virajthakur4068
4 жыл бұрын
For extc students there is any gate channel ?
@joichirogaming
4 жыл бұрын
sir last video m relation T(n/2)*2+n aya tha wo relation alg kyu h iss wale se?
@devosmitaghosh1493
3 жыл бұрын
Because this is the worst case. Simple logic if we consider, then worst case will happen when the array is already sorted either in ascending order or descending.
@ManavPatel-vm6ms
4 жыл бұрын
Sir please add end screen in your videos.
@debashisganguly5863
2 жыл бұрын
Thank you so much,!! sir😍
@rajeevvishwakarma0
4 жыл бұрын
Thank you.. sir, aap bhut achaa padhate h..
@jai63213
3 жыл бұрын
Please complete the playlist of daa
@harini.a7934
4 жыл бұрын
Thank u sir this video gave me more clarification about quick sort..
Пікірлер: 129