QuickSort Algorithm in Hindi (With Code in C)

QuickSort Algorithm in C Language: In this video we will see quick sort algorithm with code implementation in c language. This video will explain you the concept of partitioning and the overall idea of quicksort with the help of an analogy.
➡Download Source Code & Notes here: codewithharry....
➡Join this DS & Algo course & Access the playlist: • Data Structures and Al...
►Checkout my English channel here: / programmingwithharry
►Click here to subscribe - / @codewithharry
Best Hindi Videos For Learning Programming:
►Learn Python In One Video - • Python Tutorial In Hin...
►Python Complete Course In Hindi - • Python Tutorials For A...
►C Language Complete Course In Hindi -
• C Language Tutorials I...
►JavaScript Complete Course In Hindi -
• JavaScript Tutorials I...
►Learn JavaScript in One Video - • JavaScript Tutorial
►Learn PHP In One Video - • Learn Php In One Video...
►Django Complete Course In Hindi -
• Python Django Tutorial...
►Machine Learning Using Python - • Machine Learning Tutor...
►Creating & Hosting A Website (Tech Blog) Using Python - • [Hindi] Web Developmen...
►Advanced Python Tutorials - • Intermediate/Advanced ...
►Object Oriented Programming In Python - • Object Oriented Progra...
►Python Data Science and Big Data Tutorials - • Python Data Science an...
Follow Me On Social Media
►Website (created using Flask) - www.codewithhar...
►Facebook - / codewithharry
►Instagram - / codewithharry
►Personal Facebook A/c - / geekyharis
Twitter - / haris_is_here

[@freekeys]

Sir ji You'r Debugger of our life ❤️😂

[@thorcoder1]

sir maja aa gay

[@Burnz2002]

@@thorcoder1 gay?😂🤣😂

[@rohansengupta667]

LITERALLY, THE TOUGHEST TOPIC TILL NOW IN DSA COURSE. THOUGH IT TOOK A LITTLE BIT MORE TIME BUT ULTIMATELY UNDERSTOOD COMPLETELY. DID THE DRY RUN TOO, AND THAT MADE THE WHOLE THING CLEARER.

[@pranitp.29]

bhai chilla kya raha hai

[@souled_blink]

@@pranitp.29 Tero ko kya hai reh

[@pranitp.29]

@@souled_blink ok

[@patrickhudson5168]

For those having problem in understanding anything, I would advise you to start practicing questions on any website. Then after sometime, continue with this series and you will find it a bit easier to understand. This worked for me👍

[@mohitsharmagarg]

websites like??

[@patrickhudson5168]

@@mohitsharmagarg Hackerrank, codechef, codeforces, etc.

[@sarthakjoshi21]

from where r u

[@hussainkhuzema7083]

@@patrickhudson5168 thankYou

[@tanmaydeshmukh7850]

bro DSA hi clear nhi h to question kaise practice krenge.. your suggestion is good but it can be taken vice-versa. (my case)

[@VikashKumar-ox2hv]

37:28 Minimum 2 elements should be there ( this is what the if condition says ) because if there will be only one element means it already sorted and our code execution will not go inside the IF condition block.

[@aaryanaik2915]

how can the low become greater than the high in that condition ? Can you help please its confusing me

[@MrSaint-ch6xn]

➡️01:12 agar tum school gaye ho kabhi GALATISE toh........😂😂😂😂😂this makes me laugh so hard

[@thorcoder1]

yeha me to

[@adityaagarwal636]

😂

[@UnitedIndia397]

same 😂

[@vedashreeekbote724]

same ..I was watching with my little brother and he burst out laughing 😂🤣

[@SachinKumar-cp1bj]

00:27 Yeh bache n itne "HA_NALAYAK" hai....... good cover sir.....🤣🤣🤣🤣

[@harshitverma2707]

😂😂😂

[@abhayshankar1427]

harami == nalayak;

[@tiyas1915]

Lol

[@rohanraj9067]

@@abhayshankar1427 Yes I totally agree

[@Shivam-kz2dg]

Looking for this comment after listening the line

[@tanishadixit_]

We people are not only learning dsa, we are learning how to teach as well... ❤️

[@atreyanagal2790]

true

[@olt2005]

True words

[@rohitmaity3795]

should I teach you😜

[@paragchauhan6157]

0:28 Harry Bhai wanted to say harami here, but somehow controlled his emotions and ended up saying nalayak🤣🤣🤣🤣🤣.

[@TecheremHizz]

Bhai ne bahut Control kiya

[@DbCo0pEr]

@@TecheremHizz Harry bhai: ye bachhe itne hhahhh.... nalayak hai KZbin guidelines: no sla.....! ooo sorry, harry bhai

[@TecheremHizz]

@@DbCo0pEr 😂

[@shaikhnabeel6443]

Bhai maine C ar java seekh lii pr quicksort itna detail me smjh ni paya tha....maza agyii yr.. concept baitha diya

[@swarnimkamal2210]

seriously, one of the toughest topics of DSA till now, and harry bhai has made it so easy for all of us using his creative analogy! love u harry bhai!!

[@harshsingh6451]

Koi batayega yaha do - while loop q lagaya hai

[@swarnimkamal2210]

@@harshsingh6451 basically do variables iterate karwa rahe hain with different conditions therefore two while loops

[@yashwanthpasaladi2714]

bro is low means zero by default. I mean he didn't create any variables low and high & declare them, how program knows that low =0 and high=size-1 ? pls clarify

[@daksh2728]

sorting sabse easy hoti hai dsa mein'

[@utkarshjain6115]

beta merge sort aur mushkil h

[@mridulsharma3713]

harry bhai ek doubt hai apne bataya ki i aur j jab cross honge tab swap karna hai but apne if mein i

[@Hustler...01-MV]

the best teacher ever i saw . you explained the topic every eazy. the clg teachers are making to complicated .

[@duggisuggi8350]

Bro you are great one . Aap ke pass difficult ko bhi easily solve krne ka method h...

[@tanmoydutta5846]

As usual, beautiful explanation of one of the most difficult algorithms

[@amarnathprajapati2543]

सर जी, आपका प्रयास प्रसंशनीय हैं।। सादर प्रणाम स्वीकार करें।। 🙏🙏🙏🙏🙏

[@sumiuma5756]

Samajh me nahi aa rahi thi to thodi si crochet video dekh k crochet karna Sikh liy uske baad dobara se video dekha toh samajh aa gayi.. aur Harry bhai tum itna acche se samjhate ho ki samajh me to ana hi tha.. bohot kamiyaab ho tum age Jake zindagi mein yehi aasha rakhti hu mera chota bhai...

[@jabedumar9656]

Harry bhai ab to app dil main bath gya ki apki vedio dekhte hi like ki bottom dba deta hoon 🤓🥰🤗😁 . Love u Harry bhaiya ❤️❤️❤️

[@roushansingh9936]

Mazza aa gya harry bhaii... Aatma trupt ho gya sham ko... Dil khush ho gya... Love you bhaii...♥♥

[@sikandarkumar7563]

0:29 sir ji ko apne bachpan ki yaad aa gyi kya bolne wale the awesome sir eise Sikhao

[@Karthik-kt24]

Best guide for Coding🙏Thanks very much bhai...ek hi go me sab clear kar diya...you are very good teacher and it shows that your concepts are super clear🙏🙏May God bless you bhai🙏

[@shatviksmit3388]

13:40 As per I understand this the code should be one for loop starting from pivot+1 till the end of array which will check for values greater than the pivot value and then stop there and another loop starting from length-1 till the pivot+1 and check for values lesser than the pivot value and then stop there. To stop it we can use the break statement and have a variable to store the values of i and j of that iteration. But what I can't understand is how will I run it again? and if I were to use a while loop to iterate over it then the time complexity of this code will be O(Q(a+b)) which I think is really slow

[@DipsOfficial802]

First thing muze lga ki 50 min ka hai isse skip kr du, then jab video play kiya toh isel leave krne ka thought nhi aaya.... Thank you so much Harry bhai for such a great course 🙏🙏🙏

[@power_bgmi]

Literally took two whole days to understand, but when it did. It was the best feeling ever. Thank you harry bhai for the in-depth explaination, WE OWE YOU ONE!

[@yashverma2986]

if you don't wanna use do while loop in partition function then use while(i

[@pradunyakale8387]

I love this type of desi learning

[@perfecta1453]

You haris khan thara bhai haris khan quick sort ko itna asan banadega itna asan bandega viewers ne sochi na hogi

[@Filmyfan396]

Toughest sorting algorithm till now but finally understood just because of harry bhai's hardwork

[@umeralikhan6950]

Thank you for making the video of quick sort this analogy really helped me to learn and understand the concept of quick sort. Love from Pakistan ❤❤❤

[@jaipurguy2001]

Mind:just do it Me:why!! Mind:just do it / Me: me again at 29sec for 5th time to listen that🤣🤣

[@ejazmulla409]

🤣🤣🤣

[@4867Geyan]

Harry bhaijaan you are the best teacher 😌😌😌😀 love you bhaijaan that's great explain and 😊😊😊😊

[@samiulkarim6375]

Love you brother from Bangladesh. ❤❤

[@pawandeepsingh6736]

0:26 ye jo bachhe hai naa, ye itne HA..NALAYAK hai naa🤣🤣😂

[@ZESTYVIEW]

Haraaaammmmmiii 😂😂

[@rohitmaity3795]

same me bhi yahi keh ne vala tha😂

[@Trading_Club007]

Harami

[@Trading_Club007]

Pawandeep bhai data structure kha tak phuchi

[@ManishSharma-fi2vr]

Aapke prayas bohot important and helpful h

[@prabhatkeshari2976]

Thankyou harry bhai quick sort clear hai abhi...........

[@gopalkushwah8371]

Bahut acha bataya bhaiya ek baar mein samaj aagya

[@skullcandy-dp9nr]

thank you are like a big brother for me

[@karantekwani4503]

Harry bhai can you please tell which keyboard do you use because from sound I think it is a good keyboard

[@univquestknowledge8505]

In video you explain right but in source code there is decending order Because of statement in while loop while (A[i] pivot) { j--; }

[@achintya-7]

I haven't seen a better explaination of quick sort than this Thank you bhaiya

[@UttamKumar-oh7db]

Moj krdi Harry bhai...Tum toh bade heavy coder ho Bhai.

[@roushansingh9936]

Code debugger of my life - Harry bhaii😍♥💫✨

[@ashokpandey9832]

1st class example hai bhai kaha se late ho ayese examples , samjhate raho just like this.👍

[@surendrabisht2523]

Best explaination of quick sort till now. Thank you harry bhaii . You are a great teacher. You exactly know where one would have problem understanding and you make that thing crystal clear. Great hardwork for the explanation.

[@thinkingstatus2771]

Java programming me DS par video chahiye please sir Java language ki video pura follow kiye hai jo notes ke sath pdaiye hai or Java One video bhi or purane playlist Java ka bhi . Please Sir DS or algorithm par bhi video chahiye

[@ashvinimeshram5242]

Yes sir ,such type of anologies make our learning easy ,interesting

[@myselfarav3024]

I love your teaching methods sir❤️❤️❤️

[@harshthakur9890]

Crystal clear explaination

[@manashalder3999]

Yes I understand your analogy

[@RahulDas-vq4ol]

Sir aap bahut mehnat karte hai thanks for your hard work ❤️, humko quick sort samjh aa gya ✌️✌️

[@harshsingh6451]

Koi batayega yaha do - while loop q lagaya hai

[@music_lover_infinity]

very helpful, make more videos on DSA sir your way of teaching is better then others.

[@shilpaemil4122]

The best video:)

[@Bourbon_Biscuit]

Bhai apki way of explanation is extraordinary. 🙏🙏🙏🙏🙏Salute🙏🙏🙏🙏🙏

[@ritwik_shivam]

Amazing explanation as always, helped me understand the concept . Keep uploading these types videos and notes, this will be very helpful for students like me who can't understand the concepts in college properly, due to their boring methods. Big fan of yours Harry sir

[@raktimbag6832]

great vedio

[@tanmayghosh8311]

Never thought that the swap I learned as basic is soo useful

[@shreyraj1816]

Sir You said in partition point 6 j < i But in code you wrote I < j. Please clarify

[@tahamanaquib2101]

@Neen s The starting point of j = n-1(for instance 5 -1 = 4) and the starting point of i = low + 1(for instance 0 + 1 = 1) so it basically means that j should always be greater than i for the swap to work between A[i] and A[j]...as soon as j

[@dikshaverma9946]

you are the best sir,Thanks for presenting it beautifully🥰🥰🥰🥰🥰🥰🥰🥰

[@prachisinha7542]

at 40.19 min, while writing code in the partition method for 'j'', you explained the condition to be less than or equal to pivot but while writing code, you just wrote j >pivot why not >=pivot?

[@collegeWale.insane]

Same Doubt..

[@bibekanandroutray5170]

Because he run the code in do while loop instead while loop

[@viditsdanceworld6533]

12:34 Aapke examples bahut related hote hain, topics se ❤

[@ankitbadani04]

Is Python language okay for software development? My humble request is to make a video on this.

[@seizure0007]

Nhi h

[@varunmanwatkar5402]

the example that u had given at the starting is really helpful to us , thanks

[@Neerajkumar-xz5fj]

sir first teacher hai jo itne easy way me phada ta hai fan ho gya me(:

[@vaish_navi_]

Thank u for such a clear explanation , it helped me a lot, to get how actually this quick sort program works.

[@the.rajkumar.sawant]

Sir why you uploaded notes after stack implementation??

[@HarpreetKaur-wb2sk]

Excellent way of teaching

[@himanchalsingh5694]

why we are using do while loop at 42:06 , why we are not using only while loop?

[@kashinathcpr]

harry bro its my humble request pls think about the solving some competitive coding on the dsa after this

[@shivamgupta78101]

Wowww that's amazing harry sir You explanation method is lajwab...

[@abhijeetsingh4110]

This is not easy thing to teach quick sort easily but you made it this show your dedication and impressive vast knowledge about coding awesome i like it and thanks for this hard work sir

[@pramitdeepkaur5418]

Sir, you make really good videos. Please continue this DS series. We would be really thankful..

[@nextnotification9857]

I have watched 200+(till now) videos of Harry bhai, but this was the best

[@AbdulRahman-xl9jh]

Sir Your way of teaching is awesome. ❤️😊

[@debabratagon7289]

in 22:02 after "i" reaches the last element , the loop condition will be still true, so "i" will again increase by 1, so will it not cause any problem because the index number will be out of bounce?

[@harshitbansal8601]

Sir, According to me this topic better than ur way no one can understand. Bt sir i try this concept to understand so many times bt after watching this video i realise that in this concept nothing is there . And Sir u take the very good examples to thing and concept more clear in a better way. Keep it Sir . My Full Support is with You.

[@anuragmishra2769]

while (i < j); // Swap A[low] and A[j] temp = A[low]; A[low] = A[j]; A[j] = temp; return j; how is it while (ij) if we are swapping a[j] with pivot element A[low] ??🤔🤔🤔🤔

[@rishikeshsanjekar1349]

Bro while (I

[@radhasingh3549]

Really nice examples and your hard work is really appreciable 🥰🥰

[@SANDEEPKUMAR-vf5zi]

12:28 siraaaaaaaaaaaaaa prayaas :) very helpful to understand

[@samirrobin3524]

What an amazing teacher..Explaining such a tedious concept in a very simple way...Thank you so much Sir..❤️❤️❤️

[@tarun._17]

Thank You to my confidence Back sir ...😌

[@manishkumarthakur9553]

This code has some logical errors which might show for particular data values: In the while loop (inside while loops) the condition should also contain restriction on the index values. So the corrected code should be like this: .... while (arr[i] = low + 1) { j--; } ...... Please consider this

[@promptlylearn518]

Bhaiya starting me bahut acha trick use Kiya batane ka ab bhulenge nhi thank you bhaiya ❤❤

[@abhishekrathi4067]

Harry bhai thanks a lot for these videos,they help a lot! Please make one on heap sort as well

[@sarveshkapoor7177]

Harry bhai analogue = samaj ma a jayega 💖💓

[@shaquibraza4340]

sir ap difficult se difficult algo ko bhut aasani se smjha dete ho......Thank You

[@abhijaysaraswat83]

Sir i think there is a mistake in the program.' i' is used for finding the element greater than pivot element and 'j' is used for finding the element less than the pivot element but u have wriiten the opposite conditions in the if statements of the partition function.

[@dhananjayjadhav7064]

Yes bro ,I am also confused about that

[@jatinsharma4628]

Han bhai mea bhi

[@kumarrounik8523]

same here. he gave the condition (j < = i) but he took (j > i) why ????? can somebody make me understand that

[@tahamanaquib2101]

@@kumarrounik8523 The starting point of j = n-1(for instance 5 -1 = 4) and the starting point of i = low + 1(for instance 0 + 1 = 1) so it basically means that j should always be greater than i for the swap to work between A[i] and A[j]...as soon as j

[@tusharhatwar4581]

God Bless You 🙏😇

[@kirantiwari8089]

thank you for everything harty bro

[@fitness11257]

harry bhai you are one i liked most

[@avstechindian8807]

Sir please reply when are you going to make another video in Java tutorial series,please very soon sir.

[@VIVEKKUMAR-cs7ye]

Harry Bhai your heart is so big.

[@AbhishekSingh-nz4jj]

thankyou bro for putting so much effort.🤗

[@darshan_9963]

Thank you so much sir for giving code free thank you

[@Ashish123]

mza aa gya op explanation i watched this video twice and its fully clear to understand 🤩

[@ruhinaazshaikh1913]

This one was the best explanation one could ever give 💯🔥

[@21AniketThakre]

From which University

[@safarihooo0sh503]

actually no, try implementing it in an array with duplicated values

[@rohaanshahab8414]

in chrome browser the F12 Developer tools can be used for hacking and editing websites so please make a video series on its hacking. your videos are greate

[@sagarsinha668]

bhaiya very interesting example ... the way you teach... i liked it

[@lakhveer0362]

1:32 ... De dete hai danda kbhi kbhi 🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣😁😁😁😁😁

[@fashionvella730]

this is the first algorithm in which i get soooooooooooo muchhhhhhhh confused

[@yanshikarajput7399]

exactly😐😐

[@anuraglodhi2785]

Yep

[@AmazingASMR167]

Kya tha ye bhai ,😢

[@divyasaxena2509]

Example hi aise de raha ye😂

[@pranabytstatusandblog4448]

😂😂😂

[@mayankdwivedidi35]

Sir aapki video bahut acchi samaj aati hai ek video Google add pe bhi banaiye please. Apne website me Kayese laga sakte hai perfect tarike se🙏🙏🙏

[@meghasinha1706]

In cllg this topic was annoying but now I love this topic 😊😊thanks Bhaiya for making me understand