Video není dostupné.
Omlouváme se.
Selection sort algorithm
Vložit
- čas přidán 6. 06. 2013
- 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
This is almost like online tuition. You can ask questions and even request videos. We can try to get them. :)
My god . How could you know that ? Even I thought why this guy is not uploading videos.
@@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.
@@oreoshake6287 no
@@shamanthakrishnakg1978 uff
❤❤❤
Did you see our merge sort video? Its quite simplified. You may start loving recursion once it settles well in your head.
Cant we write
if(arr[j]
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.
hope that's not true
He is Animesh Nayan and he's alive
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.
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.
Rest in Peace Harsha. You will be remembered through your amazing work.
He died?
@@riyazbajishaik1596 car accident 🙏🙏
Rest in peace. :,(
Sad news. R.I.P😢😢
I really appreciate your work...one of the best channel for DS & Algo...Please make more videos
One of the greatest lecture of all time on algorithm!
I LOVE YOU! Thanks for these clips!
It was difficult for me to understand but you made me understand in 10 minutes.
Thanks
Thank you so much, will probably binge watch your videos for my upcoming DSA exam
very gratuful for you man , this really gave an overview of sorting algorithms
I just love you. You teach the way I learn !
Best explanation I ever found for sorting.
Thanks alot sir for the easiest approaches you shared with us .😊😊
Great tutorials! Keep it up i appreciate it!
some of the best material online period
thank u soo much for these good tutorials.
Can we improve algo by running c3 only if iMin is changed in c2?
amazing explanation, hats off to you sir, keep it up 👍👍
Sir hats off to you the best lectures on sorts i have ever heard thankyou so much
*_This guy sounds the same as the one on neso academy_*
yes , noticed
he also owns neso academy.
HIRAK MONDAL your comment is in bold. How you do that...
@@usama57926 *use "*" at start and end of comment*
@@RajKumar-qv7ci thank u very much
Amazing vids. Thanks for making them.
Love his voice
Great video! This was a much clearer explanation than when i took this class in college. Quick question, why would you want/need to pass in the length of the array. Are you assuming that this is being implemented in languages without built in arrays with a find/return length function? It seems like it would be unnecessary for a user to input the length.
loving your videos!!
This helps me a lot in my exam..thnkzzzzzz a lot
U saved my life
You help me so much
Thanks for your brilliant tutorial!!!
It's too good👍👍 i understood very easily bro
Your language accent is so good and sweet
amazing video, you make it so simple..
all da videos r just mind blowing
thanks bro. your teaching way is impressive.....
this was so helpful man. Thanks
this vid also taught me time complexity calculation wow! hats off....
Such a masterpiece! It is still no.1 in 2023
Good job! Nice lecture! :)
Nice explanation..
but can you please upload video for Heap Sort and Radix sort?
There's an error in the pseudocode. It's:
for i
great work..it really very helpful
May I ask what is the algorithm used in wordscapes?
You are good at teaching and creating panel
Thank you
Thank you!!!
Awesome teaching...
*nicely explained..loved it*
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)
brother, this guy is no more
@@sarfaraz6582 what happened to him
@@shubhampanwar6879 passed away years ago by car accident
@@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
Dude, please keep making videos...we need you, even in 2021...please
in 2022 too
But he died
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.....
nice explanation... thank you for these videos..
Hi , Do you have Brute-force algorithms tutorial ? Please let me know asap ! Thanks
what if we have duplicate number in the list like two same numbers. How that one number will be arranged?
The way you explain your selection sort and how you code your selection sort function is actually different in my opinion.
I also agree with this
These are fantastic and very clear. Great video!
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...
Wouldn't the part with the cost "c1" be executed "n - 2" times? Since you are starting with the index 0 till n-2
which makes
(n - 2) - 0 + 1 = n - 1
for the loop header of the outer loop. Then n - 2 for the statements inside the loop.
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 :)
he probably meant to say 2nd largest within the sorted portion of the array.
thank you!
thank u sir amazing algorithm thanks again
Thank you sir for that video it's very helpful for me
Nice,and easy,clear
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.
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?
@@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.
Excellent explanation :)
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
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 CZcams channel. The playlist link is as given below.
czcams.com/play/PLqqPVCi6glKYJ3RK_LrlljjnAk5QdcroX.html
Please subscribe the channel for any upload notification.
Actually,I also think about “if”,if it is added,the program is more efficient .
@@chouliwen4173 no.
Great explanation
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.
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;
}
}
It's O(n^2) because of the nested for loop I think
excellent explanation
what about an array like this {3,2,1} will it still work?
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
Really superb..
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
he died
@@swastiksharma6926 no Animesh nayan is alive
@@womanwhocode3032 the brain behind the channel that is Harish died and as a result Animesh is depressed and can not make more videos
instead of n could replace by array.length or return new arr[] will be more efficient
Thanks dude.
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;
}
}
}
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)
@@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
@@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.
@@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.
It's really nice...
great lecture
your tutorials r like my home tutor..:v
thank you so much.
but the subtle slide hinders understanding sometimes
beautiful !
great videos sir.. :)
*thank you so much sir*
Excellent explanation...we should make videos... excellent...
*Amazing sir*
Bro i have s question how it scans only min element y nt element next to u n tell me which is j and which is i element
please give me the time complexity analysis link
Thanks a lot
helpful.. thanks :)
Thank you sir.....
Please do a tut on counting sort, my mid is in November 1st :(
*best lecture*
Normally I am not into correcting grammar mistakes but since you say it in every video: first not 1th
great videos btw!!
First number will actually be the zeroth index . So 1th is said to avoid confusion .
Array bhai bhai bhai bhai
List behen behen behen behen
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 CZcams channel. The playlist link is as given below.
czcams.com/play/PLqqPVCi6glKYJ3RK_LrlljjnAk5QdcroX.html
Please subscribe the channel for any upload notification.
@@aryamaangoswamy179 😂
😂😂😂😂😂😂
Bro😂😂
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.
There are predefined sorting methods . These sorting algorithms are just choices in case we need to implement algorithms based on input size.
Good work👍🏻👍🏻👍🏻
can u plz upload video Radix sort... I am not getting it through other videos available till now..
please upload a lecture on linkedlist
in 2021 also best series to learn Ds
thanks dude
thanks a lot
Please provide videos on heap sort also
*very helpful*
How did you get n(n-1)2 pls explain
Great Explanation !!!
Btw which software do u use for writing things like this?
I think: paint.