Selection Sort Algorithm

[@CodeWithHarry]

Very few people have followed the playlist till here. But dont worry chahe 100 views aaye ya 1 view aaye course poora khatam karunga!

[@Sub-sw4zd]

Best content on KZbin All the best👍

[@harshitrathi3077]

Thankyou Bhaiya. We Will support you till the end. And Dont worry Views Dheere dheere aajyengey, you keep On Uploading....... Just wait and watch Till the end of 2020 you will have 1M Subscribers And 10Lakhs Views On Dsa Playlist

[@samyak235]

Dedication of Harry :o .

[@harshitrathi3077]

Quick Sort and Merge Sort is Only Left Now

[@asty8488]

Sir muja 10th ka bad coding la ne ha kya lu ma pls reply

[@sagar8880]

this man is damn underrated in his teaching skills

[@AbhishekMishra-fn5bq]

Very simple and clear explanation of Selection Sorting, Big Thanks. Please finish this course.

[@IamZaxs]

I DON'T SKIP ADS ONLY FOR HARRY'S HARDWORK

[@itsrish4real]

On the same boat on that one.

[@abhishekganapure6456]

U watch ads to complete tanvi's story

[@balajimahenderker5326]

@@abhishekganapure6456 😂🌝

[@rahulvishwakarma6235]

Tum bhut achcha kam krte ho man !!!

[@sarveshwarsingh1308]

yeah, get youtube premium

[@rvpandey-k4v]

we are very thankfull to get these kind of person who are trying to support those people who can not able to afford expensive courses for this subjects but still we are not supporting these people . i am the biggest fan of @codewithharry sir keep it doing we always try to support you but instead of being supporting some people abuse these people iit is kind of very thoughtfull think how they are living on our mother earth.

[@samirrobin3524]

Sir's way of explaining is truly amazing! It makes the complex topic also too easy for us to understand...Thank you very much Sir..❤️❤️🥰🥰

[@shatviksmit3388]

19:18 No, Selection sort is not adaptive as it will do all the comparisons as done in the case of unsorted array

[@webseriesworld1791]

19:14 As per swaps -> Selection sort is adaptive because if the array is sorted then we have to do less swaps but As per comparisons -> Selection sort is not adaptive because even in Best Case we have to do all the comparisons Thnx harry bhai for all this !!!!!

[@saharajaman894]

My favourite tutor. I always follow this channel and learn java basically. ❣️❣️

[@rupamsud718]

Chahe abhi nahi dekho gaa lekin jaab time aayega tu jarror dekho ga aur samjho gaa kyuki abhi mujhe patah nahi hain ki yai kyaa hain. Your videos are like that I can even watch them after 100 years

[@blackwolfkills]

Plzzz don't stop making these videos as they are really great........plzz

[@abhisheksah99]

i listened only for first 5 min and was able to code the selection sort thank you sir

[@prathamrajgor]

Tried Writing code Just After explanation and it Works perfectly fine void SelectionSort(int *arr, int n){ int temp; for (int i = 0; i < n - 1 ; i++) { for (int j = i+1; j < n ; j++) { if(arr[ i ] > arr[ j ]){ temp=arr[ i ]; arr[ i ]=arr[ j ]; arr[ j ]=temp; } } } }

[@gulshan2052]

Harry sir, you are awesome. You do so much of hard work for us.

[@PGiri2002]

Time - 2:34 void selectionSort(int *arr, int length) { int temp,elm; for (int i = 0; i < length-1; i++) { elm=arr[i]; for (int j = i; j < length; j++) { if (elm>arr[j]) { temp=arr[i]; arr[i]=arr[j]; arr[j]=temp; } } } }

[@adityakumar6945]

Thanks a lot ! I am a beginner ...started coding a month back. Really scatched my head over this one......

[@shaikhmukhtar5748]

I'm learning DSA with superb entertainment ❤️

[@EngineersKatta004]

My college is not serious about DSA,I think they are also watch your videos and teaches to us,But harry bhai aap jo mehenat kar rhe ho hamare liye usko 21 tofo ki salami

[@technicalnitians8968]

Bro Trees and Graphs topic is left That's the important one topic to cover in this DSA

[@ViratKohli-x8q]

Harry Bhaiya you are the best teacher for CS students Love You

[@oyepuru]

Next Roadmap Competitive Programing Brother Like For Better Reach Everyone

[@durgawatisingh8350]

Very simple clear explanation all clear understanding 👌👌👌👌👌👌👌👌👌👌👌👌👌👌👌👌💯💯💯💯

[@Ajinkya_Chirde_07]

best explanation Harry bhai👍

[@DipsOfficial802]

Thank you harry bhai for such a great course 🙏🙏🙏

[@mfcd7-]

Thanks Harry bhai you are doing great work for us❤️❤️

[@nageshsalgude3572]

thank you Harry bhai for making such useful content

[@udaykirankavaturu6942]

Harry bhaiya done with this thank you 24:37

[@knirmandeb]

Love your teaching styles bro

[@sudarshanmhaisdhune1039]

Wow! Such a learning 💗

[@Forever._.curious..]

Masttt jaa ra he 🤩🙌🏻

[@engineerbhai7642]

You deserve millions subscribers.

[@studynewthings1727]

Thankyou man to simplify concepts with perfect examples

[@ChetanBhole]

Mujhe Pata Nii Tha Apne DSA Ka Course Start Kr Diye Just Abhi Maine Playlist Access Ki.

[@anexocelisia9377]

Selection Sort Take a pointer at the start of the array and traverse the array and find the min element and swap. Then simply increase the pointer and do this till last element of the array. No, it is not adaptive as it will do comparisons for swapping even when the array is already sorted.

[@kushal6065]

pointer?

[@TwinshuParmar]

Thanks Harry Bhaiya... Stay Blessed

[@asishkumarsingh9276]

Harry bhai course bahot hi acha hai

[@aaishuagarwal6629]

Please complete the series as soon as possible

[@Karthik-kt24]

Very helpful channel! goldmine for students! may god bless u 🙇‍♂️🙏

[@than0s869]

Great Explanation Ever 🤠

[@aku_11_11]

❤️❤️ Harry bhai u r my life..💜💜 "Placement". kee liye bhi kuch tips bata do plz Harry bhai.!!!!!

[@aayushibahukhandi]

You are awesome!!! 🥳

[@HarpreetKaur-wb2sk]

Excellent way of teaching

[@yatinarora1252]

Never been this early...thanku so much for ur precious time

[@shalinisharma3777]

@codewithharry Harry Bhai A very huge thanks to you ❣️🌸✌️

[@RahmatKhanZai89]

वास्तव में अद्भुत सामग्री

[@atulwadhwa192]

@CodeWithHarry , by default its non adaptive but cant we make it adaptive??

[@abhishekganapure6456]

Kardi adla badli harry bhai khub maza aaya

[@ridham7120]

Codewithharry is the best

[@myselfarav3024]

Harry sir, you are just amazing. You deserve much more subscribers and viewers and likers and commenters...

[@VijayKumar-go6cr]

Who is following him from last year?🤗🤗

[@binodofficial8420]

Me

[@aryankumar87771]

Binod

[@kushal6065]

Binod

[@AbdulRahman-tj3wc]

Why Selection Sort is not Adaptive if number of swaps is zero in sorted arrays???

[@ShaksD-vf3go]

Goat=harry bhai❤❤

[@anshdholakia714]

19:23 not adaptive, because the algorithm will compare the numbers even if the array given is sorted

[@bug244]

Thanku haary sir for your hard work

[@sailendrachettri8521]

Must hay bhai :)

[@IT__HarshVaish]

Very simple language.

[@sharjeelashraf9887]

19:17 Selection sort is not adaptive as it requires a complete to be done in order to make the comparisons between the elements but can be made adaptive like wise we have done in the case of bubble sort algorithm.

[@ilovejs1768]

gazab explanation harry bhai

[@royfamily9273]

Thanks Harry Bhaiya

[@vedantmule6237]

Yes, I think it is adaptive , Honestly.

[@MrSaint-ch6xn]

18:20 selection sort is not adaptive

[@RohanDasRD]

Best Explanation Bhai!

[@NITISHKUMAR-vu8gy]

sir app k liye bas kya hi bplu lajawab

[@sohaibmughalmughal4680]

Great teacher

[@spicyedutainment1577]

no the selection sort is not adaptive because we still comparison the elements in case of sorted array

[@suhanikerkar]

Thanks understood well ;)

[@dipakkumarsingh9884]

Respect 🙆🏼‍♂️💯

[@Beginner..]

Heart de do naa Harry bhai Pleaseeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeee Waiting for you heart from last 2years!

[@ankurdahiya3611]

i didn't understand why Selection Sort is not (Adaptive)? because as you said in last videos an algorithm is Adaptive if our efforts are minimized if an array is sorted........here if array is sorted we didn't have to swap elements...so effort is minimized should it not be Adaptive?

[@supershorts3592]

Have you watched the whole video 😂

[@ankurdahiya3611]

@@supershorts3592 yes i did

[@MrSaint-ch6xn]

A biggest thank you for you ❤️❤️❤️😘❤️❤️❤️❤️

[@subhrajyotidas2569]

treasure of ds

[@rishabhshukla2523]

Bhai plzz continue ds lecture

[@Aspi12354]

Awesome Video👍👍

[@yasharyan9814]

bhaiya coding toh aapse hi samajh mein aati hai 👍

[@ritikchoudhary9601]

OSSUM Video bhai i

[@pankajkumarsingh3521]

greatt coursee sirr

[@manashalder3999]

Yes I understood this algorithm

[@blackwolfkills]

Great explaination.....

[@meme_menaty]

harry bhi please make a video on java in 1 video this is very imp for us

[@phnix5661]

harry sirji will you provide the notes for these videos or we should start taking notes

[@abhinavdubey_7]

Cool Harry brother ❤️

[@jairambhardwaj716]

Awesome videos ❤

[@ConfusedBeachHammock-tc8km]

Thanks a lot

[@NITISHKUMAR-vu8gy]

app se achha teacher nhi hai koe

[@rupakdutta5577]

5 months ago u promised this:"Very few people have followed the playlist till here. But dont worry chahe 100 views aaye ya 1 view aaye course poora khatam karunga!" Kaha gye wo promise ? Tbh,not one ever explained DS the way u did.

[@oyepuru]

Nice Harry Keep Going

[@sanketsuryawanshi]

Nice harry bhai thanks 🔥

[@mujeeburrehman8145]

sir selection sort is not adaptive but we can make it adaptive like key = arr[0]; min = arr[0]; aftar one whole pas we check if (key == min) return;

[@ankurdahiya3611]

lmao it'll not work bro because consider if only 1st element is less than all other elements....then it'll return for example {0,25,34,1,2} it'll return if 1st element is lesser than others

[@pankajkumarsingh3521]

u r greatt

[@princesukhala7106]

7:00min Done done

[@Matrix_Mayhem]

thanks harry bhai

[@rakeshsahoo16]

Well explained 👍

[@shivrajyadav925]

Good explained

[@anjusreetalukdar1088]

very good playlist :)

[@NavneetKaur-nc6vp]

Thanks

[@ritikjain6952]

Harry bhai we also want to see videos on graphs and trees

[@Sans_K5]

thanks_Sir💜⚡️

[@umeshchandra7441]

Sir plz make a course on game development with unity

[@SahilSingh-oc1ps]

Bhaiya tree topic bhi details m pdha do...... And thanks a lot for all your playlists ❤️

[@Zeeshanhaider-wo5bs]

Good Ho gia Boss