Quick Sort | Code and Explanation | C++ Course - 19.2

Complete C++ Placement Course (Data Structures+Algorithm) : • C++ Full Course | C++...
Telegram: t.me/apnikaksh...
Instagram: / dhattarwalaman
Notes of this Lecture:drive.google.c...

[@shreyaschavhan5522]

> Quick Sort - 0:00 > Quick Sort Function Algorithm - 1:15 > Partition Function Algorithm - 4:43 > Code - 8:10 > Time Complexity - 11:45

[@pijushbasak4273]

@Philip Adrien Sale har comment k niche tum Instra Password hacking ki bat karti ho. Coding sikhne ayi ho ya Advirtisement karne?

[@codingarjuna8677]

@@pijushbasak4273 😂😂 delete kar dia usne

[@CharansInsights]

Does anyone have pdfs of all lectures Its not available now in decription Do share it if anybody has it

[@ChessKaChaskaa]

Kya behtreen tarike se sikhaya hai mam ...wow awsome...........very thank of you

[@parthmittal5625]

informative video as always! Note : The swap function is inbuilt in C++, saving some time!

[@palashagrawal2343]

lol swap is only at strings functions

[@parthmittal5625]

@@palashagrawal2343 Well, you could try it to believe it.

[@bhavuktomar7935]

@3:37 the partitioning will be done around 6 because swap(i+1, r) will swap 2 and 6

[@santhosh7042]

yes, after watching many yt tutorials, literally the animation and way of teaching line by line made quick sort easy

[@mohammedsaqlain9856]

Bhaiya we dont no how to thank u, u and ur team may always be happy. Thank you very much "apni kaksha"🙏🙏🙏

[@RaNd0MiZeD]

www.amazon.in/Object-Oriented-Programming-C-4e/dp/8131722821/ref=sr_1_2?dchild=1&keywords=robert+lafore&qid=1607740393&sr=8-2 Best OOPS book MRP 800 Sale Price: *** ( Limited Stocks) & if finished check on Flipkart also

[@rutvikrana512]

Quick sort is amazing and fast algorithm. In average case it gives O(n*log(n) ) complexity. Best way to select pivot is to select it randomly. (Not by middle element) Quicksort is one of the fastest sorting algorithm, so C language provide separate qsort() inbuilt function. C++ sort() vs C qsort() Always remember c++ sort() is hybrid algorithm ( using different algorithms for different situations ). So sort() is more faster than qsort() in average cases. Happy learning 😊

[@hi-xu5ee]

Bro in which college and year are you studying

[@rutvikrana512]

@@hi-xu5ee ... last year of medical college. 😂 I love CS, so I am learning myself.

[@hi-xu5ee]

@@rutvikrana512 😂😂

[@vimalslab3398]

@@rutvikrana512 bruh

[@marcusaureliusregulus2833]

Lol. Medical school not busy enough for you? Heard you guys have crazy hours

[@hirdeshkumar6648]

Mam very big Thanks to make this Sorting very easy with the help of animation. I really appreciate yourself with all my heart 🙏🙏.

[@nomita2432]

uff what a video..really loved it .!!! saving my comment for future

[@tawseeftaher9109]

Partition(arr[], l, r){ pivot = arr[r]; i=l-1 for j=l to r-1 if arr[j] < pivot i++; swap(i,j) swap(i+1, r) return i+1 }

[@mujammilpinjara1537]

Today one more step for C++ placement series.👍❤️

[@harshitrathi3077]

Thankyou For This Speed. Fixed The Place Till 3rd Dec 😍😍

[@dipenchavda6988]

Man this was far better than what I was taught in college... Thank you.

[@aaditpatil4727]

You guyz are getting taught in colleges?

[@MYSTIC_ABYSS]

@@aaditpatil4727 yo, I literally saw this comment and was going to say the same thing 😂😂

[@swastikrana2670]

mst joke mara🙂

[@ѕнвнм]

She is women

[@amitpandharikar2377]

Exactly

[@vaibhavbelekar4653]

Teacher need to teach like mom. Punishment like dad.

[@gauravsinghrathore9000]

short and best video on quick sort

[@oqant0424]

simplest and best ever video seen on youtube

[@maulikshah28]

I am really liking this course Thank you aman bhaiya and all the teachers of apni kaksha

[@muhammadibrahimkhan7052]

I really appreciate your efforts thanks ...

[@ranarehan9185]

one of the really best video found ever on whole internet

[@chzain9390]

Your way of study iss very easy and when you smiling during lecture then my all the confusion is solved out... 😘. Thank you mam.. ❤️

[@Tbm4545]

Kutch samaj mein nahi aya

[@enjoy111-q1v]

wow didi, aapne toh samjha dia

[@mayanktiwari2958]

beautiful voice with great explainagion skill, thank you man

[@St.LaurentDon]

Bhaiya Master's Theoram par video i think ki nahi aayi hai...

[@akshays301]

Thank you didi, form this video understand very easily

[@sankeerthajith8070]

This is a request please make a vedio on mtech ,mtech benifits and most importantly M-TECH FROM IIT🙏

[@sankeerthajith8070]

Guys please like this comment So that HE notices it

[@debupatra2333]

didi, you should be paid as much as a college professor for these explanations

[@purnendumishra2614]

Sir, Please provide the note of this lecture,it shows that notes is in owners bin folder

[@dhwanidabhi1226]

Thank you so Much For This Video ❤❤❤❤

[@anujjadhav2771]

awesome, it made the concept easy to learn.

[@sahilsawal]

Awesome Ma'am & Sir :) 🔥😇👍✌🙏👌👏

[@vibhashkumar5554]

Only legends know video length is 15:24 ,before the video premieres

[@niladriroy1665]

Are bhai tu kaise bata rha hai?

[@harshulagarwal1755]

@Varun Shastry sahi toh hai

[@kartikchausali1598]

In lecture we were told that its our choice to choose pivot i guess Amd if thats the case then why don't we always choose median element as pivot ?

[@irshadali-xx1ms]

you can choose either first, median and last but logic would be different for each \

[@tarangpatil6952]

you can choose any element as the pivot, but the code in the partition function changes according to the pivot element

[@marcusaureliusregulus2833]

Because we don't know which is the median element. Median means the element which will be in the centre in a sorted array. But we don't know where it will be in an unsorted array. Thus we choose pivot point randomly( or first or last), point being we can't choose the median as pivot since we don't know where it is

[@aishwarya1895]

Thnk u so much... Awesome explanation ✌

[@Maheshwaripremierleague]

how swap function work, because we are not returning something how the changes which are made in swap function reflect to the main code?

[@marathiplayer9974]

Mam make vedio on python full cours for beginners plz

[@paragmahale1437]

Maan! This was so better than what we were taught in college

[@properfect5967]

Didi,why we can't use Selection sort,Bubble sort,Insertion sort. As,those take less coding, and less time in writing the code?

[@adhavpranjal2142]

hey can u tell me why i am not getting any output noe error plz???soon

[@properfect5967]

@@adhavpranjal2142either, there would be some error in written code,or in compiler May use c++ coding app(can also run offline ,without any add),as alternative for android.

[@yashvats824]

As this algo is more efficient than sel , bubble ,ins as they take (n^2)time while this takes (nlogn)time

[@partharanke5925]

your voice is really sweet.

[@anantsinghal3180]

Please upload web development course.....🙏🏻🙏🏻🙏🏻bro which telegram channel please tell me.

[@AyushSachan2211]

I will come in 2021

[@anantsinghal3180]

@@AyushSachan2211 in jan ??? And are you the instrctor of course..

[@harshulagarwal1755]

@@anantsinghal3180 sirf 2-3 days aur. Go and join Telegram where you will find details about everything.

[@anantsinghal3180]

@@harshulagarwal1755 bhai konsa telegram channel humse share kr do ....

[@harshulagarwal1755]

@@anantsinghal3180 how to grab 1crore waali video dekho Aman dhattarwal bhaiya kee

[@kashishmandlekar4746]

Make video on randomised quick sort also Thanks

[@rabatoaa857]

time complexity at 13:15

[@utkarshsolanki224]

This same array is taken in coding ninja tutorials of competitive programming

[@nikunjgarg3754]

Hey, please someone tell in which lecture bhaiya told about master theorem?

[@PulkitMalhotra]

Master recursion

[@nickfury4760]

Time complexity would be n(n+1)/2 right not n squared for worst case

[@artirani3806]

Bhaiya lecture 13 ke notes bhi daal do please🥺🙏 🙏. And shayad Rishabh bhaiya keh rahe the na ki ek telegram group h🤔🤔 uspe teachers bhi reply karte h, vo kaunsa h link de do na uska please.🥺

[@arjunshivhare8998]

Bhaiya... web development series bnao plsss😍😍

[@manishvlog240]

I like her voice 😊❤

[@adityasarin39]

Hey, can anyone guide as in which video do they explain recurrence relation ( Tree or master ) method ?

[@rajatagrwl9328]

He didn't explain....

[@palashagrawal2343]

@@rajatagrwl9328 😂

[@snehashishghosh7258]

Gate smasher

[@search_ex_muslim_sahil_yt]

They didn't explain recurssion in depth . You have to learn something from other sources also.

[@EverythingaboutTechPro]

Master theorem waali konsi video ? ?

[@rishabhprasad8333]

Ab playlist me aa gayi hai wo video

[@rishabhrawat1017]

correction : if(arr[j]

[@stephenvs531]

We haven't got notes of merge sort and quick sort . Please provide it soon. And thanks a lot for this course ❤️

[@sit33darshanpagar16]

Very good explanation

[@jameswang3222]

just a random question... Are you guys speaking hindi or English? I can't tell if you are speaking hindi with occasional English words or you're just speaking English with a very heavy accent

[@aruneshprasad3064]

They use Hinglish

[@revanthmahindra]

NOTES PLEASE

[@kartikgoyal359]

master theory kya hai??

[@itsabdullahtech]

Sorry but ap ki kuch smaj ni ai

[@rajji7390]

Why we are using quick and merge sort We have already selection and bubble sort

[@mohammadfaizanhashmi4213]

we have insertion sort also but we use all method according to situation for more optimise code

[@mishras5257]

Bhaiya aap btech biotech pai bhi ek video bna do jismai aap career opportunities, jobs, internship etc sab cover krna

[@vaishnavideoskar5834]

R there any vids coming of html, web designing??? Plzz make tutorials on web designing 🙏

[@RaNd0MiZeD]

www.amazon.in/Object-Oriented-Programming-C-4e/dp/8131722821/ref=sr_1_2?dchild=1&keywords=robert+lafore&qid=1607740393&sr=8-2 Best OOPS book MRP 800 Sale Price: *** ( Limited Stocks) & if finished check on Flipkart also

[@AnuragKumar-yj7ws]

madam 4:22 tak samajh aaya, uske baad kaise sort ho gaya pata nahi chala

[@bhaskarmodi1867]

Can you upload python complete placement course

[@adityamishra8296]

swap function is predefined ?? isn't it?

[@abhimanyu6534]

Plz explain example and code properly and relate them 🙏🙏🙏

[@AmanKumarSinhaOfficial]

Yess... Kuch samjh me nhi aaya.

[@shriyamdwivedi1547]

Bhaiya pls start Java placement course animated

[@Janaklodhi-nf7zi]

Great explanation ma'am 🙏

[@sudipc9880]

Good Explaination.

[@PremKumar-th3fj]

Bhaiya jee ke liye course kab aaega please tell Can't wait for it🔥😭

[@RamanKumar-sp9bz]

notes ka link work nahi kr raha

[@mohakgidwani1505]

Notes ???

[@ChandanJobanputra]

don't know why but my output is coming out to be very weird as it is returning elements that are not even in my array. Can someone help me with it as it was also the case in Merge Sort

[@SakethKothapalli]

Please teach in English so that people who don't know hindi can also listen🙏🙏🙏

[@charityrymbai4159]

For the notes it's showing file does not exist Please look into it Sir/Ma'am

[@kbhutani5967]

Can u pls explain the changes in stack memory in the questions done in the last lecture of recursion🙏🏻🙏🏻🙏🏻🙏🏻

[@shivamnarula1601]

Bhaiya please make aurdino tutorials

[@mancunianswagger3668]

Bhai kitte ads aate hain har 2 min pe ek ad Utube premium lene pe majboor ho rha hu mai ab

[@janvimyadventures1310]

It is giving wrong output n is also not defined I am getting output as 14523

[@nit_gaal]

Yes me to

[@nitishsingh3470]

Very nice explanation 👍

[@NikhilSharma7803]

The best

[@prabhjotkaur7780]

Plz share notes of this video . Plz

[@sahilgupta7170]

/master theorem konsi video me tha ?

[@vaibhavwani2094]

less than Expected bhaiya...

[@AmanKumarSinhaOfficial]

Yes

[@abhishekchaudhary3879]

notes are unavailable plz check it

[@achabacha3809]

Quick_short function my error btataa h (pi-1) kye pss😓😓😓😓😓

[@mridul549]

the code is the exact copy from gfg, what's the point of watching this video then?

[@sabihatahsinsoha112]

Could you please update the drive link? The link is not accessible.

[@Sourav-o7z]

Karo

[@toontelugu4564]

Thank you

[@bat_man1138]

Her voice is miraculous

[@rahulranjan4618]

Very good video

[@aswinbarath]

🔥🔥🔥Verithanam🔥🔥🔥

[@vathsan3906]

எந்த ஊரு நண்பா

[@aswinbarath]

@@vathsan3906 Naan Ooty nanba Neenga endha ooru

[@deveshb793]

master theorem kab sikhaya?

[@akvedichealth]

Bhai do do channel h apna college ke naam se kaun sa shi h

[@sharmisthasinhakashyap4949]

Where Is The Notes Of This Lecture?

[@hustlewithVaibhav]

Amazing bhaiya

[@Agam_091]

Keep it up...u guys are great

[@Neoshiva]

Why this code showing segmentation fault in vs code.......please HELP!!!!!

[@desiidea6577]

Arey bhaiya class 12 ka lecture tu dal do

[@khantanveer7066]

Why you took i=L-1; Then swapped i+1; Why not take only i; 🙂🙂

[@tarangpatil6952]

there is a for loop of int j, in which the i++ needs to be before the swap(i,j). But if you take i = L, then you will skip the first element in the for loop. Thats why

[@khantanveer7066]

@@tarangpatil6952 bro we u write i++ after swap then it solved

[@ManishRaj-zm5gs]

this code will fail if there are duplicate elements in the array

[@tusharchopra7825]

Notes does not exist

[@abhimanyu6534]

Bilkul smzhana nhi arha 😭😭

[@AmanKumarSinhaOfficial]

Sahi baat hai..