Learn Selection Sort in 8 minutes 🔦

data structures and algorithms selection sort algorithm
#selection #sort #algorithm
// selection sort = search through an array and keep track of the minimum value during
// each iteration. At the end of each iteration, we swap variables.
// Quadratic time O(n^2)
// small data set = okay
// large data set = BAD
music credits 🎼 :
===========================================================
Block Party - Bad Snacks
link: • bad snacks: KZbin Au...
===========================================================

[@BroCodez]

public class Main{ // selection sort = search through an array and keep track of the minimum value during // each iteration. At the end of each iteration, we swap values. // Quadratic time O(n^2) // small data set = okay // large data set = BAD public static void main(String[] args) { int array[] = {8, 7, 9, 2, 3, 1, 5, 4, 6}; selectionSort(array); for(int i : array) { System.out.print(i); } } private static void selectionSort(int[] array) { for(int i = 0; i < array.length - 1; i++) { int min = i; for(int j = i + 1; j < array.length; j++) { if(array[min] > array[j]) { min = j; } } int temp = array[i]; array[i] = array[min]; array[min] = temp; } } }

[@aditya_asundi]

u forgot to pin it =)

[@joyceasante8292]

Practicing... Ascending Order public class Main { public static void main(String[] args) { int array[] = {8,3,4,1,0,5,2,6,7}; selectionSort(array); for(int i : array){ System.out.print(i); } } public static void selectionSort(int[]array){ for(int i = 0; i < array.length - 1; i++){ int min = i; for(int j = i + 1; j array[j]){ min = j; } } int temp = array[i]; array[i] = array[min]; array[min] = temp; } } } ******************** Descending order public class Main { public static void main(String[] args) { int array[] = {8,3,4,1,0,5,2,6,7}; selectionSort(array); for(int i : array){ System.out.print(i); } } public static void selectionSort(int[]array){ for(int i = 0; i < array.length - 1; i++){ int min = i; for(int j = i + 1; j

[@giorgiogiorato]

4:35

[@faizanhamza4717]

Half of my tension wipes away when he says sit back and relax

[@adi_is_back]

Studying as usual one day before a test and I was so confused on selection sort, but this video has helped me a lot! Thanks and keep up the great work!

[@mykytakaida6663]

Man, I wish you will become the greatest programming KZbinr in a year

[@Remolhunter97]

He already is, he just has not enough visibility !

[@solens4810]

Me too, I love himmmm

[@BroCodez]

Thanks guys! You are all the best! ❤️

[@mrnotrobot]

@@BroCodez Thanks sir! For all the work!

[@ritikbisen798]

May your dreams come true bro 😊😊

[@hridayinfovlogs]

Bro,, Programming tortures me due to the bad teachers I have But u, r the best programmer and teacher U help me learn programming like it is just a childhood game. Thanks a lot !,

[@j.m8480]

I'm studying to become a software engineer atm... and I keep returning here time and time again for insanely good and fast introductions to pretty much ALL the concepts 🤣🤣 Bro is the master. Thank you!

[@diegoortega2374]

Thanks brother, I really liked your explanation and the effort you made to graphically show the algorithm. Cheers!

[@manikantaanumalla4104]

Super visual and incredibly interesting way of learning of DS and algorithms. Bro code rocks!!!

[@necothegrim3419]

Everybody gangsta till your teacher gives sorting algorithm assignment on *linked lists with multiple variables* .

[@halloheinz]

A man uses paint to explain in 8 minutes an algorithm and achieves more than a professor at the university in 6 Months. Well done and thanks.

[@LeoLeo-us5rs]

Best selection sort explanation on KZbin

[@patrickmayer9218]

It's basically the naive way of sorting, but slightly smarter because the array gets smaller each iteration. Thanks for the video!

[@nareshmangalpalli1480]

best Explanation + nice examples = This Video

[@supernovic99]

Thank you so much for this video bro!!! It was really helpful

[@qrinni4042]

Bro, you made this so easy to understand. Tysm

[@coder4937]

you are very good person who is teaching free of cost i'm glad to found this channel and n amazing person ^^

[@nidarr4878]

This was really helpfull. It made selection sort a piece of cake. Thanks a lot. Outstanding video

[@ShimmerBodyCream]

This is a fantastic explanation, thank you.

[@JatBadmos]

love your videos bro thanks for the help 😃

[@aminmoafi5148]

Lifesaver! Thank you!

[@JorgeFerreira-dp9og]

Best explanation ever! Thank you

[@iamfromasean705]

Thanks for the tutorial!

[@MinecraftTestSquad]

I'm just going to leave this comment on your most recent video for the best chance of you seeing it. You are insane. I'm going through your Python full course video atm and I'm about 3-4 hours in, and I just noticed that you have full course/crash course videos for several different programming languages and then also HTML/CSS on top of that. That's amazing. I might even poke through your Java course just to see what new things I'll learn even though I already know a pretty good bit about Java. I'll probably watch your Java swing videos since I don't know a whole bunch about swing. This channel deserves *MUCH* more attention.

[@BroCodez]

Thank you MinecraftTestSquad! Yes I am a little insane 🤪

[@youssofprogrammer7546]

you are amazing you are the only youtuber in whole youtube let me know this topic very very thanks

[@kenanturan824]

Hi bro. I just discovered this youtube channel so I'm happy. I learn English about for 1 years and I'll watch your videos

[@BroCodez]

Thanks Kenan! I believe there's translation available if that helps

[@ravishyadav7964]

Just amazing how many videos you are going to upload in this data structure and algo series I want to learn a lot from you

[@BroCodez]

I'm not quite sure yet. I'm planning 20+ topics for this series, there's a lot to cover

[@ravishyadav7964]

@@BroCodez yeah you can make it as long as you want because it is quite important series we will watch all of them

[@ITATheshark]

great job man, keep it up

[@BroCodez]

Thanks Maurizio! I'll keep it up!

[@sushruthkumaresan6087]

Bro finished a 30min lesson in 8 minutes and looks like its more clearer than ever

[@raihanrony1810]

Thanks for the visual presentation. I figured out how tk do it on my own thanks to the slide.

[@BroCodez]

Thanks for watching Raihan!

[@raykos4257]

Woah. That was a really good video.

[@Anonymationsthecoolanimator]

I have seen that many people love Bubble sort because it is easier to learn however I think Selection sort is better as it seems simpler to me other than being faster than Bubble sort.

[@supernovic99]

Oh my god. I completely agree. I never understood why people consider bubble sort to be easy. For me, selection and insertion sort are much easier.

[@andreuz_2998]

insertion is even better , it just make the change everytime it needs to , after studying both for hours , and practice many of examples , the conclusion was that insertion will always be better than selection.

[@okeuwechue9238]

Bubble is extremely inefficient. Shouldn't be used in RL

[@kalyankumar8629]

"bro code"ur doing really great job bro!

[@CSstudent_1001]

Great 🌸🌸🌸

[@FarizAzim]

thanks bro saved my butt in class

[@AnuragKumar-ce8hl]

wow , such a nice & simple explanation, Thank you so much Bro Code

[@BroCodez]

You're welcome Anurag! Thanks for watching!

[@abdullahalhomedna836]

Well said.

[@plasmafox2568]

Thank you bro!

[@sylvanfranklin6904]

Bro, epic graphic design on the thumbnail and explanation!

[@BroCodez]

Thanks Sylvan! I've been trying to improve the thumbnails. I'm no graphic designer tho :/

[@sylvanfranklin6904]

@@BroCodez They look great

[@cynthiaalvarez1346]

bro code, your background music is great study music. Do you have a playlist?

[@thestars8300]

Thank you so much I have a data structure exam tomorrow I hope I will get full marks

[@anonimanonim1223]

best videos

[@MrLoser-ks2xn]

Thanks!

[@Smile-ih5xf]

Have the feeling he likes carrying nines around 😂

[@marcosangelmedina5845]

thx bro, love you

[@sungazing59]

Thank you bro

[@eueudruadh2268]

Thanks bro, i really appreciate it

[@BroCodez]

You're welcome! Thanks for watching Eueud!

[@heynermarquez6652]

Great S

[@marckhycs319]

Just got busy studying PHP for final project, here I am again studying Java😁 Big thanks😍

[@BroCodez]

You're welcome Marckhycs! Thanks for watching!

[@nonameiskickass1319]

Bro is really cool 🚀🚀🚀

[@muhammedemad1155]

Thank you sir

[@ShadowKnightdxrk]

I m lucky to find his Btw im a new subascriba

[@vishalratna2703]

Congrats for 100k

[@jyotirmoydasdeep6568]

You are the best

[@hasanaalbaker1115]

thanks brother

[@KashifKhan-tq1um]

You are great Sir.

[@BroCodez]

Thanks Kashif!

[@amanthakur6913]

Amazing Explanation Bro

[@BroCodez]

Thank you Aman! I'm happy to help

[@aymanbou4847]

Thanks bro

[@okeuwechue9238]

Thnx for the vid. Very clear explanation. However, it implies that the algo is caching the VALUE of the array elements when searching for the min element. That's not the case. What the algo caches is simply the INDEX of the value, so @2:02 it should cache the index value "3", not the data value "2", then use that index value to locate the corresponding data and perform the swap.

[@AmNotLegend]

time complexity o[n2], space complexity o[1], it seems the same as bubble sorting

[@Ben_in_4k]

thanks bro

[@TonyMalik7]

thankyou so much for teach me sir your all videos are the best video i was see many video of teach coding but your teaching is best in world of youtube thank you so much

[@BroCodez]

Thank you for the kind words Tony! I'm happy to help!

[@TonyMalik7]

@@BroCodez welcome sir and thank you for reply

[@_max_7770]

hey @Bro Code may I ask you what shoud I learn in free time at hight school? I mean for the future job what will be the best programming language for example in the US. PS. I really appreciate you work at yt and I hope you will be very lucky in the future:)

[@BroCodez]

Thanks for the support max! It really varies on what U.S. employers want so it's difficult to give a definite answer. There's a lot of overlap between languages. If you know one, a lot of what you learned transfers to another.

[@piotrp4102]

Thanks

[@wahidom]

thanks king

[@jrdatutorial9862]

The best explanation

[@BroCodez]

Thank you jrda!

[@petrone1821]

Bro what do you think of flutter? Are we going to get any guides on it down day?

[@BroCodez]

maybe! I'll likely have you all vote on future video topics once I finish JavaScript and the C-family langauges

[@navjotsingh2457]

ty

[@SpeaksYourWord]

Wouldn't it be simpler if we just applied the bubble sort logic and start iterating from the end and keep swapping the smaller value to the front?

[@hannibalbianchi1466]

👍👍👍

[@tbs-founder]

just the best

[@piyushbarve2618]

Hello, Bro. I know this course has completed but can you please add Dynamic Programming in it?

[@youngo_music8089]

why did you use length-1 in the nested loop.

[@yaverjavid]

I created this without checking any algorithm: array = input("Enter Array *[max element: (10)^18] (Numbers Separated By Space):").split(" ") a = len(array) sorted_array = [] while a > 0: smallest = 1000000000000000000 for i in array : if(int(i)

[@kindness3110]

Hey Bro! Can i ask a question? why in inner loop j = i + 1, why not just j = 1? I'm still trying to getting a hang of this

[@samson-zq7gc]

I think because you are not sorting the very last element in the array. Because once the first four items are sorted, you don't have to iterate through the last element in the array. There is no where else for it to go.

[@augischadiegils.5109]

❤

[@chal7z]

tyyy

[@buraktreaty4720]

Let bro cook🔥🔥🔥🔥🔥

[@scarlett9921]

谢谢你

[@lellal5354]

holy crap its a two that quote killed me hahahaha

[@Rockyzach88]

I guess if you knew there was no repeating numbers and if the new min is 1 above it, then you don't need to search the rest of the array.

[@vishalratna2703]

Pls make a node js tutorial

[@nguyenxuanthienphu3402]

can you do networking?

[@ernestosandoval7575]

Why is it that at 7:10 (line 25) you defined int min = i? Why could it not be array[i] since we are focused on the element and it is the same position regardless? Also, could anyone explain to me the lines of code that go from line 32 to line 34? Thank you in advance.

[@loisarcangeles3954]

Great video! but may I ask what was the point of the code temp=num[i]; num[i]=num[j]; num[j]=temp;

[@vijayanks1714]

int a = 1; int b = 10; now u swap the two value u need one extra variable to store it temp so declare int temp; execution temp = b; //temp store 10 b=a; //now b store 1 a=temp; // in the 2nd step b value is change so need a extra variable to store the b variable before the 2nd step, that's the logic behind that

[@ernestosandoval7575]

@@vijayanks1714 Why is outer loop arraylength - 1? Instead of just being arraylength?

[@yon1623]

int min = 1 i; on line 25. i goes from 0 to length of array-1 . how does that help?

[@aar7790]

thank u bro

[@BroCodez]

Thanks for watching AAR!

[@harshalpatel3774]

comic sans intro

[@w3jd4n]

i don't even need an explanation atp i watch your videosjust for fun after studying

[@ernestosandoval7575]

Why is it that at 7:10 (line 25) he defined int min = i? Why could it not be array[i] since we are focused on the element and it is the same position regardless? Also, could you explain to me the lines of code that go from line 32 to line 34? Thank you in advance.

[@w3jd4n]

​@@ernestosandoval7575 we declare the index only so it's easy to work with indexes when we want to traverse through the array

[@w3jd4n]

@@ernestosandoval7575 we have 9 elements, outer for loop compares the first 8 elements with the inner loop/last 8 elements. we compare i with j and if i is bigger than j, we swap i with j using the help of the two variables, min & temp

[@w3jd4n]

@@ernestosandoval7575 btw we use min variable so we don't lose the reference of i if you're wondering why not just directly use i

[@baubaudinamo]

thx bro

[@BroCodez]

you're welcome Alex! Thanks for watching and commenting!

[@saisaketh23]

Hey Bro Code love ur videos

[@BroCodez]

Thank you Sai!

[@mikhailsandigan1424]

What software are you using for your explanation?

[@BroCodez]

Paint.net I'm not skilled with animations, but I'm decent with my photoshop skillz

[@mikhailsandigan1424]

@@BroCodez thank you bro, you are an inspiration!

[@yon1623]

I dont understand the code. but atlist i have the code for the homework.

[@GrittyMaholmes]

what are your c specs

[@nevilleodhiambo1370]

how are you printing the result am running the same code as you but it just print the first unsorted array...please help

[@khajazulfiqaar43]

🥲 thanks🌹

[@toxiclucien8168]

pog

[@VictoriaLaRocque]

nice voice :)

[@deadvision22]

Omg

[@lemmgua]

HOLY CRAP IT'S A TWO

[@weirdchamp7790]

Chad programmer