I hope you teach at a University. You would have been my favorite teacher.. The moment you said lets trace this logic with a simple example at 20:45. You became a Master Professor with Tenure in my heart.
You are my best!!! you explain the logic with tangible steps makes simple to understand. KEEP ON you are above and beyond the computer sciences professors.
You and your classes are very important to a students like me where we don't have a good teaching professors in my clg . U people are doing a great job . Making the students life brightful through your wonderful lectures . This kinda work is really really great. We are grateful to you sir.. thank you very much sir
After assigning min = 2,the next iteration of j will have a[min] as a[2] not a[1]. Each time we should compare the value with last found minimum value.that is min.if next value is less than min..then min=j that value.
thank you so much sir... you make awesome videos and i did suggest my friends too which was really helpful .... in this video theirs a correction in logic of itteration 2 i=1,1
Sir let me tell you something Ur explaination is very nice and anyone can understand topics But here problem is u should execute in editor Becz ur programs causing lot errors so if when u teach in editor u will know that
Hi dilkesh Hope you find the video on merge sort. Thanks for your support and interest towards our channel and share our channel with your friends. Keep following our channel.
Thank for your explanation sir, but there is small correction, outer for loop need not to iterate for 5 times 4 iterations is enough then 5th element will automatically settle in its appropriate postion.
hi sure and soon i will try to upload the data structures concepts. thanks for your interest towards our channel and share my sessions with your friends and subscribe to our channel.Keep following our channel.
hi verendra thanks for your interest towards our channel and share my sessions with your friends and subscribe to our channel.Keep following our channel.
8 9 5 6 7 ......try this it doesnt gt sorted with above code i think swapping should happen after every iteration of innner for loop. correct me if i am wrong
sir if the element are 5,3,1,2,6,4 . so in that case there will be 3,5,1,2,6,4 in first iterations. But you are telling that lowest element will pe put in first position in first iterations.
hi venkatesh i am using Turbo C Compiler but you can use any compiler. thanks for your interest towards our channel and share my sessions with your friends and subscribe to our channel.Keep following our channel.
I hope you teach at a University. You would have been my favorite teacher.. The moment you said lets trace this logic with a simple example at 20:45. You became a Master Professor with Tenure in my heart.
Same thing I found
I have not understood the program
Until it was traced😍
Sr, your way of teaching is unique from others 👌👍
I like your way of teaching
You are my best!!! you explain the logic with tangible steps makes simple to understand. KEEP ON you are above and beyond the computer sciences professors.
Thank u won't be enough it seems, you are faaaaaaaaaaaaaaaaaaaaaaar better than my teachers Sir.. May God bless u ❤️
You and your classes are very important to a students like me where we don't have a good teaching professors in my clg . U people are doing a great job . Making the students life brightful through your wonderful lectures . This kinda work is really really great. We are grateful to you sir.. thank you very much sir
Big fan
Thank you Sir 🙏🙏🙏🙏♥️😊😊♥️
Thank you sir..🙏
for this informative video thank you so much...sir
Sir your teaching is super
Super explanation sir
Good explain
Sir,Yr teaching is great. Very useful and more interesting to see yr videos
Legend you are sir Great explanation ❤️
I watch all lecture of data Structures
It's really helpful for me.
Sir ur way of teaching is amazing ❤
Sir your way of teaching is amazing🥰
Too perfect explanation sir tq sooo much
sir apne bahut accha samjate hai thank you sir
I love your channel
Nice video sir, we appreciate u always, perfect way of teaching, 🙏🙏🙏🙏🙏🙏🙏 Tnx sir
Hi sir when 10
Great sir...you give the real meaning of the word teacher
I am very thankful to you sir🙏🏻
Nice explanation sir an average student can also able to understand very clearly....
very nice sir
Sir outer loop
For(I=0;I
i am getting my concepts clear here!!!❤👌
Sir after modifying the min in inner for loop like in first iteration min becomes 2 when j=2 Again when continuing the process for j=3,3
Wow! I am loving your lectures
Nice explanation sir.
You deserve much respect
Super explanation sir.
very good explanation sir
Thanks sir.......really very helpful
Thank you sir... this is really helpful..
hi
thanks for your interest towards our channel and share my sessions with
your friends and subscribe to our channel.Keep following our channel.
Nice explanation sir.. May i know complexity of selection sort and which is better sort.. Either bubble, insertion or selection sort
Best Average Worst
Selection Sort Ω(n^2) θ(n^2) O(n^2)
Bubble Sort Ω(n) θ(n^2) O(n^2)
Insertion Sort Ω(n) θ(n^2) O(n^2)
@@sundeepsaradhi thank you sir 😊
Sir you the best
Nice explaination sirrr...
Good explanation #scratchlearners
After assigning min = 2,the next iteration of j will have a[min] as a[2] not a[1].
Each time we should compare the value with last found minimum value.that is min.if next value is less than min..then min=j that value.
I was thinking the same
thank you so much sir... you make awesome videos and i did suggest my friends too which was really helpful .... in this video theirs a correction in logic of itteration 2 i=1,1
What is the algorithm of selection sort
Sir wiil you teach Java , data mining,r program, python etc
Why it’s size-1
Thank you sir🙂🙂🌝
This video is helpful
We are expecting all concepts of Data structure like this.
Thanku!
sir your explaination is fantastic Sir..... Sir plz upload, diff types of pattern printing
Sir plz rply me sir in my clg they said datastructures through java programing manner we can also write through c lang also na sir plz rply sir
Love your classes sir, I wish as like u some1 should come to teach me
hi
thanks for your interest towards our channel and share my sessions with your friends and subscribe to our channel.Keep following our channel.
Sir let me tell you something
Ur explaination is very nice and anyone can understand topics
But here problem is u should execute in editor
Becz ur programs causing lot errors so if when u teach in editor u will know that
RIGHT
Thank you sir
Sir pz ..keep the program wtever u r writing on screen ..to note down for us
All good sir, but there's a very minor mistake at iteration 1..... J=3,3
Sabhi program board per btaya Karo sir plzzzzzzzzzzzzz ....
Very well explained sir☺..please try to make a video on merge sort
Hi dilkesh
Hope you find the video on merge sort. Thanks for your support and interest towards our channel and share our channel with your friends. Keep following our channel.
Thank you sir.........u are genious...
nice explanation sir......
can you use bigger white board........to explain....?..please...!
Sir please data structures ka bhi video daliye
Sir why are we assigning "min=i",
Can we use "i" directly sir?
If not please try to teach for us . it's my request from me sir
sir why dont you use
// a[i]=a[i]+a[min];
// a[min]=a[i]-a[min];
// a[i]=a[i]-a[min];
instead of third variable
And also happy teachers day😄
Sir descending order ki example b karwa day
Thank for your explanation sir, but there is small correction, outer for loop need not to iterate for 5 times 4 iterations is enough then 5th element will automatically settle in its appropriate postion.
sir if u dont mind i want to give a suggestion that light is disturbing so much
please resolve this problem immediately sir
Please make a video on Linked List in C , thats an important topic leftout in your playlist sir !
hi
sure and soon i will try to upload the data structures concepts.
thanks for your interest towards our channel and share my sessions with your friends and subscribe to our channel.Keep following our channel.
I think when j becomes equal to 3 min value gets updated
i love you sir g
Sir for selection sort is is n-1 if n=5 we need to do 4 passes sir
sir your explanation is too good....i want to know the program of quick sort
Thanku sir
2nd view
hi verendra
thanks for your interest towards our channel and share my sessions with
your friends and subscribe to our channel.Keep following our channel.
8 9 5 6 7 ......try this it doesnt gt sorted with above code
i think swapping should happen after every iteration of innner for loop.
correct me if i am wrong
same to me
hloo sir in this simple bubblesort will come in exam are not plz tell me sir
I think selection sort and insertion sort, both are same, am I correct?
Tq sir
sir if the element are 5,3,1,2,6,4 . so in that case there will be 3,5,1,2,6,4 in first iterations. But you are telling that lowest element will pe put in first position in first iterations.
sir!!!! what is the version and name of your c editor .its better than what i am using
please help me out with it.
hi venkatesh
i am using Turbo C Compiler
but you can use any compiler.
thanks for your interest towards our channel and share my sessions with your friends and subscribe to our channel.Keep following our channel.
Sir why we are starting i=0
But in bubble sort we started i=1
So what is difference between them
Plz reply
Sir please make a video on infix prefix and potfix
Ty sir
Really really helpful
In 2nd iteration you took i=0 ,1
Sir plz make video about linked list please sir...🙏😫
You should make more vedio on Algorithm.
Python and c language selection sort program is same
Thanks in advance.. Plz answer
hi priya
thanks for your interest towards our channel and share my sessions with
your friends and subscribe to our channel.Keep following our channel.
how to find sir this question...
I wrote same program in my exam,and my lecturer gave 0 marks for this program.Is this program is correct ?
Not correct its wrong
wrong program bro
I need pdf one🙏
How many vtu ppl watching this before the exam XD
Let's me your email
hi
my email : askme.selflearning@gmail.com
Thank you sir
Thanku sir