Selection Sort | Logical Programming in C | Naresh IT
Vložit
- čas přidán 7. 09. 2024
- Selection Sort | Logical Programming in C | Naresh IT
** For Online Training Registration: goo.gl/r6kJbB ► Call: +91-8179191999
Subscribe to our channel and hit the bell 🔔🔔🔔 icon to get video updates.
💡 Visit Our Websites
For Classroom Training : nareshit.in/c-...
For Online Training : nareshit.com/c...
--------------------------
💡 About NareshIT:
"Naresh IT is having 14+ years of experience in software training industry and the best Software Training Institute for online training, classroom training, weekend training, corporate training of Hadoop, Salesforce, AWS, DevOps, Spark, Data Science, Python, Tableau, RPA , Java, C#.NET, ASP.NET, Oracle, Testing Tools, Silver light, Linq, SQL Server, Selenium, Android, iPhone, C Language, C++, PHP and Digital Marketing in USA, Hyderabad, Chennai and Vijayawada, Bangalore India which provides online training across all the locations
--------------------------
💡 Our Online Training Features:
🎈 Training with Real-Time Experts
🎈 Industry Specific Scenario’s
🎈 Flexible Timings
🎈 Soft Copy of Material
🎈 Share Videos of each and every session.
--------------------------
💡 Please write back to us at
📧 us.training@nareshit.com/ 📧 online@nareshit.com or Call us at the USA: ☎+1404-232-9879 or India: ☎ +918179191999
--------------------------
💡 Check The Below Links
► For Course Reg: goo.gl/r6kJbB
► Subscribe to Our Channel: goo.gl/q9ozyG
► Circle us on G+: plus.google.co...
► Like us on Facebook: / nareshit
► Follow us on Twitter: / nareshitek
► Follow us on Linkedin: goo.gl/CRBZ5F
► Follow us on Instagram: goo.gl/3UXYK3
I was confusing between index I and j , I seen several video but didn't understand ,but this explanation is Goat 💥💥💥
o saaru nuv maa kosame puttav
dhandalayya dhandalayya
no one can explain this topic in a easier way u did,
hatsoff sir...
One of the Best explaination I have seen for algorithm tysm 💕sir
Srinivas sir is the king of programming...🙏🙌
No just a good tutor
@@vaibhavsingh8485 yea
Amazing way of explanation Srinivas Sir!
Have watched many videos on this topic but the way you make us understand each iteration by dry running on board is simply mind blowing!
Pls keep educating us with your knowledge sir...
Teaching is crisp and clear . Good video and explains logic clearly
didn't understand the explanation in my class, now i know, thanks sir!
BIG help. This helped me complete of the problems for my CS50 class at Harvard!
thank you!
Mee explanation ki
mee timing ki
Mee fluency ki
take a bow sir 🙇♀️
Bubble sort ni selection sort asal alphabetics nerchukuna antha easy ga chparu
This is a great video. One of the simplest explanations I have ever come across on CZcams.
Yr thanku mene pura CZcams dekhne ke bd mujhe apki video se smjh aya selection thanku sir
Thank you soo much Sir.
It was very helpful.
Nobody made me understand the logic of writing program.
But you did.
I'm very thankful to you. 😊
Easiest explanation to understand this topic . ❤Thanq so much sir
your way of explaining makes things more easier to understand. Hoping for more videos like this. Sir
I've been watching many videos to understand this but they didn't help, but i finally found this one and i understand selection sort better now.
Thank you very much !
Sab samamjh m a gaya pls keeep it up i will refer n recommend your videos only
THANK YOU SO MUCH SIR, U REALLY MADE ME UNDERSTAND THIS AMAZING THING...............
Best I have ever seen explaining programing in great manner
Sir you are doing a great job!!.....i have watched a lot of your c programming videos......pls continue uploading ......we support you!
Best explanation 😌
Thank you sir 🤗
Me aapka hr leactute attend krti hu sir jii because aapki explanation is fentastic 👍👍🙏🙏😇😎😎😇
🙏🙏🙏
Best teacher I have ever been taught 😍😍😍
sir aajse aap se hi permanent padhenge.... Radhey Radhey sir
Sir I think u made a mistake,its i
wow! awesome explination sir .thank u
I actually usderstand this sorting technique by you only after a long time
You are awesome sir🙏🙏
No one can explain like you sir ❤️
Sir excellent explanation 💯💯
Right 👍👍👍 👌👌👌
Sir please explain quick and merge sorting please sir your explanation is very nice
sir u explain very awesome, huge fan sir👏👏🙏🙏
thank u for helping us by making this type of video
Sir please makes the video
On merge sort , quick sort,heap sort🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏
Excellent 👌👌👌 leactute sir jii 😎😇😇😎😇😎😎
Keep it up sir jii🙏🙏👍👍
👏👏👏
Nice lecture
Best explanation
Sir please include time complexity and space complexity also
Very Good Explanation
wow, just go into the head at once only
thnku so much sir
Excellent explanation!!
Sir very nice explination 👍👍
But problem is absence of code
Code is also compulsory sir
sir by listening to your videos there is no need to go outside courses and you are the best teacher
Superb explanation sir
Sir please sir full course pettandi sir mee videos super sir
Great explanation 🎉
best video with easy explanations sir
Sir thanku sir dil se sir
Good explanation sir!
Thanku sir...... ur vdos r vry helpful👌👏👏
Sir, n
Thank you very Much sir
LEGEND!!!!!!!!!!!!!!!!!!!!!!!!!!!!
Best explanation ever for sorting
Lvu sir
Thank you so much sir ... I understood it better
Amazing sir superb
Excellent sir....
best teacher.....thanks sir
Sir thank you soo much! Your lecture helped me alot and i know understand this concept very well
Now*
actually
awsm it was a lot of help keep it up tq
Ohh my god what an explanation 🙏🙏
thank you sir..i watched many videos to understand it..this one is the best
@Naresh i Technologies Please upload a video on Merge Sort. HOPING FOR A POSITIVE RESPONSE!
Thank you so much sir it helped a lot🙏
Excellent Lecture
really excellent explanation thank you very much sir.
Thank you very much
nicely explained
thank u sir for your good help full class
Super explanation
Hello sir greetings for the day!
I'm degree student can we use n value as n=7 in the program itself instead of writing for(i=0,i
Thank you sir I understand this topic in your video
Very good explanation sir
Simple and nice explenation
Thank you sir 👍👍
sir please make a video on merge, quick and heap sort
Very helpful
Best explanation.
Nyc explanation
Sir it's too much help full providing your videos I would be like to join you're classes I m from kanpur in uttar Pradesh.
Just go to HYDERABAD
and join nareshit ... Only way to meet sirji
package only;
import java.util.*;
//by akhileshreddy created selectionSort sort program
public class SelectionSort {
public static void main(String[] args) {
int num,i,j,min,temp;
Scanner obj=new Scanner(System.in);
System.out.println("enter the array size");
num=obj.nextInt();
int a[]=new int[num];
System.out.println("enter your array number");
for(i=0;i
Just Goat 🐐
in this program it is not finding the minimum element after selecting the ith element. Once it gets the number just less than it, it swaps
Again fantastic sir👍💥
Thanks to teach well sir only u r the one of the best teacher
Thank you sir
Thank you 😊
wow sir thanku
Sir can u please explain the frequency one... Of array 🙏🙏
package enjoy;
// selection sort in String
public class SelectionSort {
public static void main(String[] args) {
int min;
String a[]={"akhi","abhi","doctor","egg","babu"};
for(int i=0;i
Thankyou sir... 😍😍
Superb sir
Thankyou Sir
Nice explanation sirrr
Best explanation
Sir,,You are best😍😍😍😍
Sir why you didn't declares the ,array of a and (n) also u didn't declares
Very nice
Sir is the process of swapping is similar in merge, selection, insertion?
thank u so much
Sir can we write j=1 in the place of j=i+1 please clarify sir! 7:56
No
You can
sir I have a small doubt in this algorithm, so actually the min value in every iteration is increasing by one so instead of writing min=j can we write min=min +1. can u pls clarify sir ?
Who said min value is increasing by one everytime, it's like u didn't understand the algo, watch again.