Selection Sort Algorithm
ฝัง
- เผยแพร่เมื่อ 12 ก.ย. 2024
- Selection Sort Algorithm in Hindi: In this Data Structures and Algorithms video we will see how selection sort works and how we can use selection sort to sort the array of size n. We will analyze and see how many comparisons and swaps this algorithm takes to arrive at the time complexity!
➡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
Very few people have followed the playlist till here. But dont worry chahe 100 views aaye ya 1 view aaye course poora khatam karunga!
Best content on TH-cam
All the best👍
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
Dedication of Harry :o .
Quick Sort and Merge Sort is Only Left Now
Sir muja 10th ka bad coding la ne ha kya lu ma pls reply
this man is damn underrated in his teaching skills
19:18
No, Selection sort is not adaptive as it will do all the comparisons as done in the case of unsorted array
I DON'T SKIP ADS ONLY FOR HARRY'S HARDWORK
On the same boat on that one.
U watch ads to complete tanvi's story
@@abhishekganapure6456 😂🌝
Tum bhut achcha kam krte ho man !!!
yeah, get youtube premium
Very simple and clear explanation of Selection Sorting, Big Thanks. Please finish this course.
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 !!!!!
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..❤️❤️🥰🥰
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;
}
}
}
}
My favourite tutor. I always follow this channel and learn java basically. ❣️❣️
Plzzz don't stop making these videos as they are really great........plzz
i listened only for first 5 min and was able to code the selection sort thank you sir
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.
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;
}
}
}
}
Harry sir, you are awesome. You do so much of hard work for us.
Next Roadmap Competitive Programing Brother
Like For Better Reach Everyone
Bro Trees and Graphs topic is left
That's the important one topic to cover in this DSA
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
I'm learning DSA with superb entertainment ❤️
Very simple clear explanation all clear understanding 👌👌👌👌👌👌👌👌👌👌👌👌👌👌👌👌💯💯💯💯
Thank you harry bhai for such a great course 🙏🙏🙏
@CodeWithHarry , by default its non adaptive but cant we make it adaptive??
Mujhe Pata Nii Tha Apne DSA Ka Course Start Kr Diye Just Abhi Maine Playlist Access Ki.
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.
best explanation Harry bhai👍
Thanks a lot ! I am a beginner ...started coding a month back. Really scatched my head over this one......
Thanks Harry bhai you are doing great work for us❤️❤️
You deserve millions subscribers.
thank you Harry bhai for making such useful content
Harry Bhaiya you are the best teacher for CS students Love You
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
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.
pointer?
You are awesome!!! 🥳
Harry bhaiya done with this thank you 24:37
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?
Have you watched the whole video 😂
@@supershorts3592 yes i did
❤️❤️ Harry bhai u r my life..💜💜 "Placement". kee liye bhi kuch tips bata do plz Harry bhai.!!!!!
Wow! Such a learning 💗
Why Selection Sort is not Adaptive if number of swaps is zero in sorted arrays???
Who is following him from last year?🤗🤗
Me
Binod
Binod
Very helpful channel! goldmine for students! may god bless u 🙇♂️🙏
Please complete the series as soon as possible
18:20 selection sort is not adaptive
Masttt jaa ra he 🤩🙌🏻
Harry sir, you are just amazing. You deserve much more subscribers and viewers and likers and commenters...
Love your teaching styles bro
Bhai plzz continue ds lecture
वास्तव में अद्भुत सामग्री
Thanks Harry Bhaiya...
Stay Blessed
Thankyou man to simplify concepts with perfect examples
Great Explanation Ever 🤠
Very simple language.
19:23 not adaptive, because the algorithm will compare the numbers even if the array given is sorted
@codewithharry
Harry Bhai
A very huge thanks to you ❣️🌸✌️
Goat=harry bhai❤❤
Thanks Harry Bhaiya
harry sirji will you provide the notes for these videos or we should start taking notes
Kardi adla badli harry bhai khub maza aaya
Codewithharry is the best
Never been this early...thanku so much for ur precious time
Harry bhai course bahot hi acha hai
bhaiya coding toh aapse hi samajh mein aati hai 👍
harry bhai konsa software use kr rhe ho ye explain krne ke liye
app se achha teacher nhi hai koe
Heart de do naa Harry bhai
Pleaseeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeee
Waiting for you heart from last 2years!
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;
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
Excellent way of teaching
treasure of ds
Must hay bhai :)
Thanku haary sir for your hard work
Yes, I think it is adaptive ,
Honestly.
greatt coursee sirr
gazab explanation harry bhai
Sir plz make a course on game development with unity
7:00min
Done done
First view
Learning coding at age of 13
I am 12
Lol
Thanks a lot
OSSUM Video bhai
i
Well explained
thanks harry bhai
Thanks
harry bhi please make a video on java in 1 video
this is very imp for us
no the selection sort is not adaptive because we still comparison the elements in case of sorted array
sir app k liye bas kya hi bplu lajawab
Bhai hashing ke video upload karona!
Best Explanation Bhai!
Yes I understood this algorithm
Thanks understood well ;)
u r greatt
Mast kag raha dir mai pahle bar se ikh raha hun
19:08 no not adaptive will do n-1 passes and n^2-n comparisons
thanks_Sir💜⚡️
A biggest thank you for you ❤️❤️❤️😘❤️❤️❤️❤️
harry bhai sath mai code bhi karaya kro yar please ......overall your content is very good
Bhaiya tree topic bhi details m pdha do...... And thanks a lot for all your playlists ❤️
Great teacher
Great explaination.....
Harry bhai we also want to see videos on graphs and trees
Respect 🙆🏼♂️💯
Day 22 of commenting until Harry bhai makes a PyQt5 tutorial
Nehi krega gund maralo
Awesome Video👍👍
Nice harry bhai thanks 🔥