Selection sort algorithm

See complete series on sorting algorithms here:
• Sorting Algorithms
In this lesson, we have described Selection sort algorithm and analyzed its time complexity.
Series on Time Complexity:
• Time Complexity Analysis
For updates on videos and courses, subscribe to our channel.
You may also like us on Facebook:
/ mycodeschool

[@mycodeschool]

Did you see our merge sort video? Its quite simplified. You may start loving recursion once it settles well in your head.

[@nilamshanker4660]

Cant we write if(arr[j]

[@mycodeschool]

This is almost like online tuition. You can ask questions and even request videos. We can try to get them. :)

[@bubaighosh8500]

My god . How could you know that ? Even I thought why this guy is not uploading videos.

[@nithingunamgari871]

@@bubaighosh8500 Nope, the person teaching is pretty much alive and is working at Google. (Animesh Nayan). However, another co-founder kinda guy (Harsha aka Humblefool) died in an accident. Those circumstances led to the closure of the channel.

[@rameshchandrapola1102]

@@oreoshake6287 no

[@shubhamsulakhe3382]

@@shamanthakrishnakg1978 uff

[@shankar7435]

❤❤❤

[@swetamahajan6416]

These videos are really awesome.Please post more videos on C programming and if possible on java,python,c++ or any other language you want or on data structures and algorithms because you are doing a great job. Your videos helped me a lot.You make things simple and concise.

[@mycodeschool]

We are always comparing with A[iMin] i.e the current minimum,, so, its against 7, then against 4 and then against 2. Its not always against 7 because iMin is getting updated.

[@bob_factory]

I saw a lot of comments below asking for new videos from this guy, This is 2020 and it has been 7 years since this video was posted and the content is top-notch. However the author is no more and suffered a loss of life by a speeding car while crossing a road. May he rest in peace.

[@andrewdavies5722]

hope that's not true

[@shashiprabha9029]

He is Animesh Nayan and he's alive

[@MelDen-h9z]

One of the greatest lecture of all time on algorithm!

[@CSSoda]

Rest in Peace Harsha. You will be remembered through your amazing work.

[@riyazbajishaik1596]

He died?

[@mohammadashraf1070]

@@riyazbajishaik1596 car accident 🙏🙏

[@Plavokosi_Marko98]

Rest in peace. :,(

[@kondowewilas-qe7hp]

Sad news. R.I.P😢😢

[@dkp8230]

Rest in peace 😢

[@dileepbc5901]

dear sir, we are following ur entire content please update this course with more algorithms , please bros who like this series give thumbs . (from india)

[@sarfaraz6582]

brother, this guy is no more

[@shubhampanwar6879]

@@sarfaraz6582 what happened to him

[@sarfaraz6582]

@@shubhampanwar6879 passed away years ago by car accident

[@AbhishekSingh-hy4dm]

@@sarfaraz6582 bro its not this guy its the other cofounder of the channel his friend who died..the guy who speaks in the video works for google now

[@tanmaysrivatsa8550]

It was difficult for me to understand but you made me understand in 10 minutes. Thanks

[@davidgmos]

Great lesson, I think the final code can be optimized... void selectionSort(int* A, int n){ int temp; // temporary variable for (int i=0; i < n-1; i++){ // n-2 passes (last element comparisons are not necessary) for (int j=i+1; j < n; j++){ if (A[j] < A[i]){ // there's a smaller value ahead temp = A[i]; // interchange positions A[i] = A[j]; A[j] = temp; } } }

[@saajankumarjha244]

how's this optimized ? what you've done is nothing but bubble sort with swapping of min elements. Time complexity for both is O(n^2)

[@davidgmos]

@@saajankumarjha244 yes that's optimization swapping elements only when needed, that implies fewer instructions per pass and less execution time even with the same time complexity

[@saajankumarjha244]

@@davidgmos here's a scenario for you consider an array {5,4,3,2,1}, let me know which one is optimized in terms of swapping.

[@davidgmos]

@@saajankumarjha244 mine because in the worst case scenario (like the one you propose) swapping occurs through all the array and time execution is almost the same, but when it's not the case (like the vast majority of cases) the lines that swap positions in my code execute only when is necessary because they are inside the "if" condition.

[@chelseakatsidzira7153]

some of the best material online period

[@ayushcode5804]

Love his voice

[@BNFY1]

Such a masterpiece! It is still no.1 in 2023

[@ryujiyamasaki355]

Thank you so much, will probably binge watch your videos for my upcoming DSA exam

[@anton.encours]

it probably would make sense to add another "if" statement, to check if the min is different from i (then swap is needed). Right now, we are swapping every time, even when it is not needed

[@RajeevKumar-ch4kg]

Hi Anton, We are building a huge video tutorial of solutions which are asked in the interview. and we need your feedback on our video content. We believe that we can achieve that if you are around with us. So please come to our KZbin channel. The playlist link is as given below. kzbin.info/aero/PLqqPVCi6glKYJ3RK_LrlljjnAk5QdcroX Please subscribe the channel for any upload notification.

[@chouliwen4173]

Actually,I also think about “if”,if it is added,the program is more efficient .

[@jayjhaveri1906]

@@chouliwen4173 no.

[@farazhusain925]

I really appreciate your work...one of the best channel for DS & Algo...Please make more videos

[@blake1835]

Selection sort. In computer science, selection sort is a sorting algorithm, specifically an in-place comparison sort. It has O(n2) time complexity, making it inefficient on large lists, and generally performs worse than the similar insertion sort.

[@blake1835]

His definition of in-place for this algorithm that you showed makes sense but from other examples i see swaps and not copying values to a new array. In place means there is NOT a use of extra data structures that will be created then deleted. Selection sort is said to be an in place but you are saying it is not? is this explanation wrong or am I confused?

[@unknownguywholovespizza]

@@blake1835 well it can be both in-place and not-in-place. Generally, not-in-place are used to make explanation easier. But in-place is much better.

[@LUX1111111111111]

I just love you. You teach the way I learn !

[@hirakmondal6174]

*_This guy sounds the same as the one on neso academy_*

[@shubhampatel5576]

yes , noticed

[@anshul6516]

he also owns neso academy.

[@usama57926]

HIRAK MONDAL your comment is in bold. How you do that...

[@RajKumar-qv7ci]

@@usama57926 *use "*" at start and end of comment*

[@usama57926]

@@RajKumar-qv7ci thank u very much

[@annmaryjose7880]

U saved my life

[@rupaliroychoudhury2300]

I think for selection sort, time complexity for best case should be O(n) because if one traverses through the already sorted list, then one can always come out of it after finding that it is already sorted instead of traversing again. Here is my code : int temp, min = 0, index = 0; bool swap = true; for(int i = 0; i < num && swap; i++) { min = arr[i]; swap = false; for(int j = i; j < num - 1; j++) { if(min > arr[j+1]) { min = arr[j+1]; index = j+1; swap = true; } } if(swap == true) { temp = arr[i]; arr[i] = min; min = temp; arr[index] = min; } }

[@tej4o3]

It's O(n^2) because of the nested for loop I think

[@yahyayozo8660]

very gratuful for you man , this really gave an overview of sorting algorithms

[@SmartProgramming]

amazing explanation, hats off to you sir, keep it up 👍👍

[@ventin75]

The way you explain your selection sort and how you code your selection sort function is actually different in my opinion.

[@blake1835]

I also agree with this

[@ahinsa__parmo__dharam]

Best explanation I ever found for sorting. Thanks alot sir for the easiest approaches you shared with us .😊😊

[@Juznik1389]

I LOVE YOU! Thanks for these clips!

[@qaisurrehman7106]

Sir hats off to you the best lectures on sorts i have ever heard thankyou so much

[@prayagparikh8020]

It's too good👍👍 i understood very easily bro Your language accent is so good and sweet

[@energizedphy6bybhathiyawij9]

This helps me a lot in my exam..thnkzzzzzz a lot

[@juhabach6371]

Dude, please keep making videos...we need you, even in 2021...please

[@ankitatomar1343]

in 2022 too

[@anmol9886]

But he died

[@paramjeetchauhan]

thanks bro. your teaching way is impressive.....

[@ronakpatil6081]

this vid also taught me time complexity calculation wow! hats off....

[@amittamrakar7661]

*best lecture*

[@beauty876]

You are good at teaching and creating panel Thank you

[@Azmayenfayek]

all da videos r just mind blowing

[@souravjagati10]

*nicely explained..loved it*

[@TheMcallist1]

Amazing vids. Thanks for making them.

[@bhaskerthapa6534]

thank u soo much for these good tutorials.

[@sudhanshusingh208]

Hi, I recently found out about your channel and why did you stop making videos you are so good at it. Its a request if you could upload more videos about cs if possible. Love your work

[@swastiksharma6926]

he died

[@womanwhocode3032]

@@swastiksharma6926 no Animesh nayan is alive

[@VivanRangra]

@@womanwhocode3032 the brain behind the channel that is Harish died and as a result Animesh is depressed and can not make more videos

[@amritanair6640]

There is a mistake at 2:37, it is supposed to be the second smallest element and not second-largest. Thank you for the videos, they are absolutely amazing :)

[@bmrreddy2002]

he probably meant to say 2nd largest within the sorted portion of the array.

[@dunno4729]

You help me so much Thanks for your brilliant tutorial!!!

[@RahulKumar-cg9sf]

great work..it really very helpful

[@jayshrinikam19]

I found it complicated than other explanations..Why can t you have variable to hold the index of minimum value from each pass. Then swap the first element and the minimum element. So in next pass start from 2nd element to find second element and so on...

[@sayyedaaman5719]

Thank you sir for that video it's very helpful for me

[@silentcod3r]

You mentioned that this algorithm is slow, but technically, it is not if n (size of the array) is small. As n gets bigger, it can begin to get slower yes.

[@sanjanaattanayake4231]

Thank you!!! Awesome teaching...

[@JannisAdmek]

Normally I am not into correcting grammar mistakes but since you say it in every video: first not 1th great videos btw!!

[@karanrandhir9865]

First number will actually be the zeroth index . So 1th is said to avoid confusion .

[@chingiskhant4971]

You're so good!!!! Indian tutorials forever!

[@sidneyeubanks8224]

Great tutorials! Keep it up i appreciate it!

[@tanm7610]

loving your videos!!

[@tbtb3096]

Totally worth that horrendous zomato ad

[@harshjha7795]

excellent explanation

[@aishwaryaghosh4329]

Excellent explanation...we should make videos... excellent...

[@mohitahlawat4944]

Great explanation

[@geeky_world]

in 2021 also best series to learn Ds

[@beardlessspirit4946]

please do the lecture for file pointers i.e, lecture on streams..... we are having a lot of trouble in learning that....... thank you for all the lectures till now.....

[@pallabiguha7991]

teacher: lets talk about simple sorting scenerio. teacher: *takes out adult uno cards*

[@aviroxi]

lmao

[@sagardolui2998]

amazing video, you make it so simple..

[@moniruzzamanmoni676]

Excellent explanation :)

[@eligirl100]

this was so helpful man. Thanks

[@Kaustubh560]

Good job! Nice lecture! :)

[@shivenpatro3602]

Good work👍🏻👍🏻👍🏻

[@naveenareddy9042]

Nice,and easy,clear

[@amanchauhan-jl9ls]

Nice explanation.. but can you please upload video for Heap Sort and Radix sort?

[@VishalKumar-lk1pt]

great lecture

[@m.mubashar786]

*Amazing sir*

[@amaan0]

*Thanks Animesh*

[@mikeyyychang8402]

instead of n could replace by array.length or return new arr[] will be more efficient

[@christorok1906]

These are fantastic and very clear. Great video!

[@kursemov7860]

álgorithm, not algórithm anyway, thanks for the video, man you are great!

[@silverzero9524]

Array bhai bhai bhai bhai

[@aryamaangoswamy179]

List behen behen behen behen

[@RajeevKumar-ch4kg]

Hi Miscritz, We are building a huge video tutorial of solutions which are asked in the interview. and we need your feedback on our video content. We believe that we can achieve that if you are around with us. So please come to our KZbin channel. The playlist link is as given below. kzbin.info/aero/PLqqPVCi6glKYJ3RK_LrlljjnAk5QdcroX Please subscribe the channel for any upload notification.

[@shubhamsulakhe3382]

@@aryamaangoswamy179 😂

[@spaceandtechnology5214]

😂😂😂😂😂😂

[@iam_tanishmall]

Bro😂😂

[@nilashishchakraborty3983]

There is an issue with this algorithm. If u take inputs as 4,2,1,8 it gives back 2,1,4,8 as output. And it is not an issue of the code because the sorting algorithm itself specifies this sort of output it. Please check it :) P.S: I might be wrong ;)

[@jef4300]

it gives 1248 for me

[@vishnuprabhaviswanathan546]

Really superb..

[@butterflybraganza]

Time complexity explanation was pretty vague. I felt the second expression should be (n-2)(n-2)C2/2

[@debajyotideori]

*very helpful*

[@rohitsinghal100]

nice explanation... thank you for these videos..

[@usama57926]

thank u sir amazing algorithm thanks again

[@aseemlalfakawma5084]

Thanks dude.

[@SaratKumar-qk7lu]

Hello, Thanks! for the Explanation. It's good to start for learning. I have a small doubt. At present we have shortcuts are available like Arrays.sort(), Arrays.parallelSort(); Comparable and Comparator etc., We need to learn this sorting Algorithm._ (I don't know that's the reason I am asking.) _.*It anyone knows please provide the answer. * Please provide any links. I need to learn more about this. Thanks and Regards, Sarat.

[@JoeJoseph79]

There are predefined sorting methods . These sorting algorithms are just choices in case we need to implement algorithms based on input size.

[@MegaGangsta4life]

I love your accent xD

[@mycodeschool]

MegaGangsta4life - Thanks bro :)

[@AyushKalani2]

mycodeschool Full desi tadka , Nice

[@monicaslv323]

+MegaGangsta4life Me tooo!!!!

[@SadSilentSlim]

+mycodeschool Where you from?

[@moumitasen6453]

+Abdurrahman AKAL India

[@fitnessislifelong]

Why i

[@m2tdev]

thnks

[@nayeembadhusha4759]

Please provide videos on heap sort also

[@abhinashmahor6227]

please upload a lecture on linkedlist

[@Pradeepkahera]

Superb..

[@sourabhguptaurl]

thank you!

[@shahriarhaqueabir7687]

your tutorials r like my home tutor..:v thank you so much. but the subtle slide hinders understanding sometimes

[@anshumansharma6334]

Explanation is very congested and hastened. Go over the points a bit more patiently

[@akarrshsrivastava7310]

Just a suggestion!!!!!!!!!!!!!!!!!!!!WE dont need to swap even if the chosen i element is already minimum in global array

[@aneeshtiwari6893]

*thank you so much sir*

[@dhineshbabu7275]

It's really nice...

[@8147333930]

Thanks a lot

[@RathourShubham]

*nice one*

[@nitpal9958]

Why use iMin at all? Why not simply use i instead of iMin? We can do the comparison A[j] < A[i] and it will give the same result. void SelectionSort(int A[], int n) { for (int i=0; i

[@anmol9886]

Just for sake of better understanding

[@mondal1839]

*Splendid*

[@likithasahukari457]

Thank you sir.....

[@miguelpetrarca5540]

nth term in arithmetic series is calculated by a (sub n) = n ( (a1 + a (sub n) )/ 2 ) , if last term is 1, and first is (n-1), how do you get n(n-1) / 2

[@जयश्रीराम-ब7म]

thanks

[@unknownguywholovespizza]

There's an error in the pseudocode. It's: for i

[@venkatasubbareddy.g2283]

Could you make the data structures and algorithms videos using java

[@RajeevKumar-ch4kg]

Hi Venkata, We are building a huge video tutorial of solutions which are asked in the interview. and we need your feedback on our video content. We believe that we can achieve that if you are around with us. So please come to our KZbin channel. The playlist link is as given below. kzbin.info/aero/PLqqPVCi6glKYJ3RK_LrlljjnAk5QdcroX Please subscribe the channel for any upload notification.