L-3.6: Selection Sort | Time Complexity(Best, Avg & Worst) Analysis | Stable or Not | Inplace or Not

0:00 - Selection Sort
6:01 - Time complexity

►Design and Analysis of algorithms (DAA) (Complete Playlist):

Other subject-wise playlist Links:
--------------------------------------------------------------------------------------------------------------------------------------
► Operating System :
►Database Management System:
► Theory of Computation
►Artificial Intelligence:
►Computer Networks (Complete Playlist):
►Computer Architecture (Complete Playlist):
►Structured Query Language (SQL):
►Discrete Mathematics:
►Compiler Design:
►Number System:
►Cloud Computing & BIG Data:
►Software Engineering:
►Data Structure:
►Graph Theory:
►Programming in C:
►Digital Logic:

---------------------------------------------------------------------------------------------------------------------------------------
Our social media Links:
--------------------------------------------------------------------------------------------------------------------------------------
►For Any Query, Suggestion or notes contribution:
#intel #selectionSort#Algorithm#DAA

[anayakhan]

Thank you sooo much sir .
I think you are the best teacher for all CS subjects .
Thanks for good explanation .

[Abtu]

Sir, your teaching is awesome... please provide lectures on ADC and digital logic for NIELIT.

[NaveenRawat]

@5:6 min should not be 50 it should be 30 which is after 50, correct me if i'm wrong please

[livetheworld]

I wish there would have been an option of like more than one time. ❤️

[musicalkhushal]

Thanx a lot Sir for such a great 🙏🙏🙏🙏


Now i came to know about Selection Sort 🙏🙏🙏🙏🙏

[himanshupal]

yrr kya method h teaching hats off broo

[ProudpunjabPb]

Thanks sir aap very good study krate hai ❤

[vinitasingh]

Thank you so much sir, I was waiting for your videos. Thanks alot,

[meetbrahmbhatt]

That was a really good explanation. I appreciate your knowledge sharing. 👏🏻

[TanyaSingh-vlxj]

sir your way of teaching is great, but one request to you plzz provide black screen, so that our eye will relax during watching the class .

[deepakrampure]

Sir, , i didn't see anywhere a very good teacher as like u..🤗💖✨

[ojasviagrawal]

sir thankyou so so much itte time se sorting nahi samjh aa raha tha, aapki wajah se poora clear ho gaya☺

[syeedamisbaanjum]

This seems complicated for beginners. It would have been better if you could explain everything while writing on board.

[bhavanakumari]

Can you please explain counting sort, radix sort and bucket sort ?? It's a huge request.

[ramshasarwar]

Sir please make as soon as possible I need that's my presentation topics.

[sudhansusekharsahoo]

Sir I m very much thankful to u...Ur explanations are much good

[shubh_shukla]

Sir, please include some relevant gate questions also for every concept you explain.

[SangharshGaming]

class SelectionSort{
public static void main(String [] args){

int a[] = {2, 1, 32, 11, 5};
for(int i = 0 ; i<a.length ; i++){
int min = a[i];
for (int j = i + 1 ; j<a.length; j++){
if(a[j]<min){
min = a[j];
a[j] = a[i];
a[i] = min;

}
}
System.out.print(a[i]+" ");
}
}

}

[SHAHIDRAZA-doxe]

Thank you sir for giving us the free content

[pratimagangwar]

Thank you so much sir🙏 for giving goo explanation