8.3.1 Sorting in Arrays | Selection Sort | C++ Placement Course

Notes of this video: drive.google.com/file/d/1zkOX...
Apni Kaksha Instagram: / apnikaksha
Apni Kaksha Telegram: t.me/apnikakshaofficial

[@dippelarc8997]

✤People will throw stones at you. Don't throw them back. Collect them all and build and empire.✤ Thank You A.D.

[@ChiruVishnoi18082003]

kzbin.info/www/bejne/sKO4nImln6h5Zs0

[@sauravrawat5587]

😂😂

[@shrutidas359]

why people will throw stones at her🤔🤔🤔

[@ashutoshharma]

they had us in the first half

[@starkendeavours7072]

Lovely...dil khush ho gya ye sunke❤️❤️❤️

[@THEELECTRICGUY]

There is a small mistake in the video!!! If you look at the stepwise output(of array sorting) of the outer loop, then you will find that the working of the code is not the same as explained via the video!!!! Here is the correct code for that: int small,s,count; for(int i=0; i

[@sakshamarora9122]

I think the code in the video is correct. If we aren't able to find the smallest element then there will be no swapping because we have a if statement judging it. And also the swapping takes place inside the scope of if statement.

[@sakshamarora9122]

@@THEELECTRICGUY wait I need to code it now.

[@_rahulsain]

@@THEELECTRICGUY whats the difference , it will take same time

[@THEELECTRICGUY]

@@_rahulsain Selection sort, bubble sort and insertion sort have same time complexity(ie O n^2)but have different internal working according to the theory. The code you write should clearly define which sorting method you are using.

[@_rahulsain]

@@THEELECTRICGUY you didnt change the logic, you changed the code a bit but it is working as in video i see no difference

[@shreyaschavhan5522]

Notes - Selection Sort - Concept - [1:10] Selection Sort - Algorithm - [3:50] Selection Sort - Code - [4:40] Brain Teaser - [6:45]

[@ritikshrivastava9442]

thankyou bhai tu har video me ye hi comment mar raha hai

[@shubhsYT]

@@ritikshrivastava9442 nalla h na islie

[@subhanjanbasu4642]

@@shubhsYT tera baap jaisa

[@sanketsingh5555]

@@subhanjanbasu4642 na tere baap jaisa

[@science2564]

@@sanketsingh5555 na tere baap jaisa teri profile se he lg rha hai

[@nikhillodhi7427]

Will watch all these videos after my board examinations... Now came here to give a like for there hardwork👍👍

[@ChiruVishnoi18082003]

Me to. From which board are you

[@ChiruVishnoi18082003]

I am from cbse board

[@Pratyush_Srivastava24]

CBSE , same here

[@soniabhatia9853]

Same

[@krishjani9629]

Same here.... From Gujarat boards

[@saranshyadav66]

NOTE: At 4:51 Instead of selection sort bubble sort logic is used but selection sort logic was explained. Selection Sort Function is given below in c++: ************************************************** void selectionSort(int a[], int n){ for(int i = 0; i < n-1; i++){ int min = i; for(int j = i+1; j < n; j++){ if (a[min] > a[j]) min = j; } int temp = a[i]; a[i] = a[min]; a[min] = temp; } }

[@khushinautiyal1858]

doing god's work

[@aimld28_utkarshpandey41]

kzbin.info/www/bejne/rpSzd4h5nZWdipI Bubble sort is this bro!

[@coderfek]

Good job. This is hell of a confusion .

[@nitikadhiman5068]

was looking for this comment only... galat code btaya hai

[@__idyllist]

Actually this one is right

[@musicenjoyer4202]

You guys are putting so much effort, without EXPECTING. It makes me feel indebted to you guys and makes me work harder so your efforts don't go in vain

[@delhuniversity]

can you please find error in the prog

[@nepaliladka8526]

@Harshil Pandey #include using namespace std; int main() { int n ; cin>>n; int arr[n]; for(int i=0;i>arr[i]; } for (int i = 0; i < n-1; i++) { int min = i; for (int j = i + 1; j

[@pradyumnmishra3459]

And also thankx to all teachers who are making such a great effort. And finally with the help of your videos, I become capable of solving the given problem. Thnxx sir and mam🔥

[@Vishwadeep_ceo]

to make This 8 :32minute of video it has taken atlest 2 days for the whole process like animation , index, etc. Give a big like for all the educators of apni kaksha . 👇 👇

[@ApnaCollegeOfficial]

It takes us 2 days to make a 7-8 min video. Script + Shoot + Edit + Animate + Edit + Review + Notes

[@KodiLearn]

2 hrs mai toh mere jaisa simple videos vi complete nahi hota 😂🤣

[@pradhumangupta8469]

Bhai 2hr really ?? Very bad guess, it took more than 1 working day for such short video ( I know coz I m plus student and he told us in casual talks)

[@Vishwadeep_ceo]

@@ApnaCollegeOfficial yes sir . I totally agree with u

[@niladriroy1665]

@@Vishwadeep_ceo edit kar diya.... 2hrs ko 2 days kar diya. 🤣🤣

[@KrishnaGupta-dd1mo]

The things which looks tough in college are now looks easy . Thanks to Apna College Team

[@rounakghosh469]

Waiting for the day when educational videos will start trending in KZbin ❤️

[@AbhishekKumar-nz9dn]

india me chapri bohot bhare hue hai ,jinka education se koi lena dena nhi hai .

[@hatcoder]

I will bring that day buddy 🤞🤞

[@shabdsaran5131]

Thank you very much sir,you are the one who's thinking is epic. May you stay happy all over your life and also very very thanks to your team.🙏

[@arunkumarsingh2724]

Not sir she's madam😂😂😂

[@sumitsharma6738]

didi ka jo josh hota hai starting hai usse mereko motivation aa jati hai seriously.......

[@mohdakib8448]

frequency of video is just awesome your consistency and hard work will pay off best of luck everyone

[@jayasrivastava4220]

Aman Bhaiya your video is used to be so amazing ki kisi chote bacche ko bhi samajh aa jaye. My daughter is in 8 standard but infact she is able to understand the topic Of higher classes and now learning c++. Hats off to you!!!

[@devashreesharma3865]

The girls that explains the concept is the best. She explains so well better than anybody here. And the way she explains makes me more interested in the subject and would want to do better and better day by day.

[@talhabinsiam4757]

learn this selection sort very easy and effective way from this channel.Thank you so much mam.

[@saurabhshandilay8261]

This does not seem like selection sort rather it is more like bubble sort but in reverse order. Because in selection sort u find the min element and swap it with the first element, so there is only one swap in each iteration, but in your case there are n, n-1, n-2... swaps with every iteration same as bubble sort.

[@user-zw1xp7it3o]

Yes you are right ... they have used another sorting algorithm as Selection Sort

[@rishaadkhan6995]

actually, they have used selection sort but with two pointers.

[@C_mee]

instead of finding a minimum of all the element in second loop, here the minimum is itself being stored in arr[i], this works fine but this is not in adherence to the theory of selection sort.

[@adityarawat9338]

@@rishaadkhan6995 where is the pointers?

[@sachijoshi9161]

The way you explain is amazing. you make the concepts so easy understand. Thanks

[@__idyllist]

In coding you have to learn how to rewrite the concept in code. Probably/almost all are aware about the concept. But don't know how to implement and she has written a wrong code. Once you try by yourself you'll know! Thank me later!

[@ajayarjunwadkar4808]

mam in outer loop there should be i

[@smile8510]

teaching in such a simple way is awesome.

[@shivammaurya3451]

Thank u mam and aman bhaiya mam u're explanation helps a lot to understand the concept thank u mam

[@abhayranjan5878]

Add more puzzles.. these are really interesting ❤️❤️

[@nickrathee8891]

@ 8:23 ----- (15 buyed) + (5 from wrapper of 15)+ ( 1 choco from 3 wrapper 2 wrapper left) + (buy 1 additional to get 1 wrapper so total we can have 3 wrapper) + (1 choco from 3 wrapper) - total = 23

[@pranayakhand1535]

You Guys are Awesome yrr ... Your Video are so much helpfull for us...keep going guys ❤️

[@LASTWOLF]

Write an algorithm to find the longest sequence in order(ascending) from the given array: {23, 65, 15, 43, 10, 25, 35, 42, 18} and print the sequence. Write a C program for the same.

[@smrutikamble7255]

This is a slow and understandable video ..Di pls keep this speed as it is😃💙

[@LifewRoshu]

Thank you so much AMAN BHAIYA and the whole team of APNA COLLEGE ❤️❤️✨✨

[@ggv-informationtechnology6645]

Please have a look at selection sort algorithm. It seems that algorithm doesn't match with your implemented code in the given notes

[@kiranp5828]

These guys are just amazing.And they were doing such a great work. They were giving a very quality education for free. Please guys support them all.🙏🙏🙏

[@aryansharma-wf8sn]

Didi you make such a difficult topic so easy 😊🥰

[@prernachoudhary2197]

Keep the spiritual high bhiya and team ...may god bless you.. And brain teaser was amazing ....

[@vidneshsharma9194]

Easy explaintion thanks Di ! 😊😊 , You R best teacher in the 🌍 😇...

[@sarthaknitnaware]

Awesome explanation!😍😍

[@AkhilKumar-zo4rh]

Bhaiya kisi din apni kaksha + apna college ke sabhi teachers ke saath ek video bnao naa...(face reveal and their intros)....vo sb ki kaafi mehnat kr rhe h unka thoda fame to bnta h...

[@suman-majhi]

He is following Robert Kiyosaki rules

[@vathsan3906]

@@suman-majhi what is that?

[@suman-majhi]

@@vathsan3906author of Rich dad, poor dad....a book...just search for it bro

[@NITISHKUMAR-tr9bc]

@Akhil Kumar seeedhe seedhe bolo na bhai ki jo mam padha rhi hai usko dekhna hai 😂😂😂😂😂😂😂😂😂😂😂😂😂

[@vathsan3906]

@@suman-majhi which rule?

[@jagjeevankashid]

This is the correct implementation you have implemented the bubble sort :- for(int i=0;i

[@sahilrana11]

thankyou sooo much it helped me a lot. you all are awesome more power to u.

[@tusharnath9402]

Urvi Di teaches so damn good. All the concepts gets cleared. Thank you so much, Di and Aman Bhaiyya and team. Loads of luck and love to you!

[@manthanpatil2268]

Dear Teachers of Apna college, Please update the code as the code given in the video is of Bubble sort and not of Selection sort 🙂🙂

[@ADEEBARASHIDBAI]

try this code #include using namespace std; int main() { int n; cin>>n; int arr[n]; for(int i=0;i>arr[i]; } int temp=0; for(int i=0;i

[@cosmicAK]

yes

[@jeetendranathmishra3701]

exactly

[@muradahmad9357]

literally I've been thinking that what just really happened🥲

[@fannypack7705]

It's selection sort dude

[@mohammedsayeed330]

mam ki voice sunke hi dil bargaya 😍

[@ganeshnaik778]

seems the journey is big with apna college

[@dits745]

Thank you Aman bhaiya😀😊

[@rutvikrana512]

We can use inbuilt method swap(a,b) to swap two elements. 👌

[@conquerworld_in]

One of the best series BUT just a simple suggestion, please show us a solution with debugging the code so that we can get a better idea, but now as series is fully made please just put a video on how to debug program so that every one of us can do that and understand every code with full Efficiency.

[@shivaaysinghrajput4760]

Thanks for adding puzzle questions...

[@simranarora3864]

When I did dry run- When i = 1 and j loop was going on from 2,3,4,5 Three swapping took place Which is not the case of selection sort you told in theory

[@manavkampani8367]

Code for the puzzle at the end: #include using namespace std; int main() { cout n; int rate; cin>>rate; int total_chocs=n; int rem_wraps{0}; int new_wraps=n; int new_chocs{0}; while(new_wraps+rem_wraps>=3) { new_chocs=(new_wraps+rem_wraps)/3; rem_wraps=(new_wraps+rem_wraps)%3; new_wraps=new_chocs; total_chocs=total_chocs+new_chocs; } cout

[@SajjadAhmed-lc2dr]

behtarenn

[@ayushpathak1638]

this one is better i think #include using namespace std; int main(){ int count=0; for(int i=0;i

[@mdtipusultan7889]

Chocolate buying calculation was awesome 👍👍.

[@freemusi2015]

Sir please give brain teaser in every video.....Thank you❤️❤️❤️❤️❤️

[@bcsmadhavanand]

End part puzzle was amazing 💥

[@codingWorld709]

Yeah really, I have spend some time and found a general formula to calculate any numbers of chocolate.... 💓💓💓

[@sameerraj5800]

This was an easy brain teaser. I solved it within 10 seconds.

[@rahuldravid288]

Han bhai boht bdiya cool lgra hai bohttt💥

[@sameerraj5800]

@@rahuldravid288 Are bhai itne purane comment pe reply kiya😂

[@shardulrastogi4369]

Waah maza aagya, once upon a time, I used fear with this!

[@Dev_Bhattacharya]

love you bhaiya and its team

[@jaymeenjogiya8798]

I think there is a conflict in the theory of the selection sort vs the code , code looks like bubble sort

[@rounaksharma9091]

yea i feel the code is wrong ,its bubble sort code

[@rakesharigela7337]

@@rounaksharma9091 yes

[@hhhhhhhhh963]

Agreed

[@AbhishekKumar-nz9dn]

she didn't also clarify by telling us the explanantion of the code

[@hhhhhhhhh963]

@@AbhishekKumar-nz9dn Explanation is correct, Code is not upto the flowchart provided by GFG. We can't expect everything as top notch from a well structured free course😂

[@AnkitKumar-zx9nh]

20th video is private , what happened to that one

[@shoebilyas5368]

lol good one XD

[@hassaanraheem5644]

Wo Kal public hogi bubble sort topic hai.

[@hassaanraheem5644]

@KZbinr Muntazir Bhai KZbin Mai agr aap chahte ho ko koi video specific time pr upload ho tu aap timer lgakr chor dety ho or wo video playlist mai jaga leleti hai lkin private rehti hai tb tk jb tk uploadation ka time nhi hojata.

[@SHUBHAM23P]

thank you so much for your efforts sir

[@035asadali8]

when i start programming and see these videos ,i thought wth is happening now i can understand so easily .

[@Risheendra]

I did my Btech in IT from private college, but no one taught me like this. Thanks mam..you are best.

[@ayushmansharma1402]

Ma'm it is not a selection sort ,yes your explanation is correct for the selection sort but u had did coding of bubble sort in the video , because we can see that in the coding ,the continious swapping is going on for each iteration. But if we talk about selection sort , than the swapping occurs only 1 time for each iteration ...... // selection sorting ....... #include using namespace std; int main(){ int n; cout

[@top7gram567]

I agree with you bro

[@sevenhours1137]

really awesome content guys....

[@niknurulhuda3018]

thank you sister. im finally done with my coding

[@AkibHussain]

Concentrate all your thoughts on the task at hand. The sun's rays do no burn untill brought to a focus.

[@jagritiyadavv]

Nice quote.

[@doitwithease4111]

guys is there any person following this course seriously and would like to help me in clearing some doubts....i mean we can discuss our doubts related to this course cuz i am doing C++ for the very first time and i encounter doubts and there is no one to clear them....i have many doubts in video 6.3.......

[@pranayraj8945]

What kind of doubts do you have..??

[@shauryarana502]

I can try to ans.

[@adityaswarup4011]

yup...i am an expert .. feel free to ask your doubts???

[@rishikeshkumar7275]

Yes

[@doitwithease4111]

@@pranayraj8945 in video 6.3 bhaiya explained decimal to binary conversions etc....i couldnt understand all those things....if u r on instagram then kindly add me "aakarshmiglani" this is my insta id.....we can discuss over there....or can even call if u r comfortable with it

[@sanjanasinha7477]

Thanks bhaiya for uploading videos this videos are just awesome bhaiya please upload video on mca intrance exam also.

[@shubhambhardwaj8894]

Awesome explanation ❤

[@vaibhavkesarwani2687]

You don't have to swap with the every small element you get. We have to first find the index of the smallest element and then do the swap with it. Please do the correction.

[@pritamsarkar3371]

exactly

[@priority_cute]

Yeah

[@nandhinireddy2980]

Yes

[@sasikirane1638]

May be the code was of bubble sort instead of selection sort🙏

[@amantarar9077]

iss comment ko top parr lao,otherwise padhne walon ko confusion hoegi

[@AbhishekKumar-nz9dn]

yes bhai ,definately gadbad hai

[@rabiahafeez-cg8hz]

Thanks ma'am I've seen now this video and code is clear running

[@muhammadtamour2286]

While doing task I am not understanding it quite properly but after watching this video it makes me too much comfortable 😉

[@phatakom]

Wait, the code looks like of bubble sort not selection sort

[@top7gram567]

I agree

[@udittatisar5336]

Wahi to Yaar

[@husler7424]

so its actually a Bubble sort code? and do we need to write another for Selection sort?

[@pavankumar-gp9zx]

i think it not exactly a bubble sorting code, see the next video then will get clarity

[@yagamilight08]

nahi...selection sort me minimum ko baar baar "select" karte hai....bubble sort me minimum khud hi "bubble up" hota hua start me aa jata hai...different hai

[@rutvikrana512]

Selection sort in this video ....💕 Left in Queue: - Insertion sort - Bubble sort - Merge sort - Quick sort - Heap sort - Counting sort - Radix sort - binary tree sort - and many more .....

[@Samconery]

Nice lecture. But one thing I would like to add is you need to explain the WHY? For example why do we end the first loop before n-1 and why we start the second loop after the first element. Computer Science students will know why because they can cross learn with college but other students will not be able to. The why is important to understand to remember the concepts forever otherwise it will cause confusion far into the future. This was a relatively simpler topic but more advanced will require the need to understand WHY?

[@geetanshagrawal]

Please also explain about time complexity for the sorting algorithm

[@Saurabh-jv7pf]

I'm totally confused with the code. It's like a bubble sort but it's neither bubble sort nor selection sort. But the code works very well.

[@relaxandsleepmusic809]

by the way last problem was amazing 🙌

[@rudrantukirde8743]

Solution is wrong

[@catdog3264]

@@rudrantukirde8743 did u understand about the last one chocolate. how she brought extra chocolate. plss explain

[@amanagnihotri6794]

Mind-blowing 😍

[@shivam3628]

amazing explanation mam 😊

[@isitMaaz]

I thought we have to code the brain teaser and I started doing that.....lol

[@aryanagrawal689]

tu bits m hai ?

[@isitMaaz]

@@aryanagrawal689 nhi

[@nagatouchiha6883]

Muzhe bhi yahi laga.. 1hr barbad hogaya mera😂🤣

[@manansinghal5634]

THIS IS NOT EXACTLY SELECTION SORT IN SELECTION SORT THE WE DO NOT CHANGE EVERY ELEMENT SMALLER THAN THE I INDEX....WE JUST HAVE TO CHANGE THE SMALLEST. ELEMENT WITH I INDEX.......PROVE-SUPPOSE THE INITIAL ARRAY IS 45 12 23 51 19 8 ......but after the completion of j loop for the first time the array will be 8 45 23 51 19 12 but the array should be 8 12 23 51 19 45.

[@AbhishekKumar-nz9dn]

yes ,gadbad hai

[@sandeshwar7407]

After buying all those 22 chocolates, I'll give it to you ma'am😉😋😍

[@ShubhamSharma-nn3ly]

Amazing explanation

[@user-nm4vn9tq5o]

Wtf man, this code isn't sorting the array.Irony is how confidently you post this video without even cross checking.

[@ydafukomi]

I tried it, and guess what? IT WORKED. Maybe just double check your code before confidently posting shitty comments from next time on❤

[@Fun.Adda143]

Bhai ye selection sort ke jagah bubble sort ka code laga di hai ye galat hai

[@sarthaknitnaware]

Didi ki voice😍❣

[@rahulsinghchauhan5634]

This is very helpful for me👍👍

[@VictorBose-wt7xf]

nice problem. Was able to solve it in one go.

[@pranavchoudhary6491]

Bhaiya just a reminder( I know you definately remeber) Please upload the notes of previous video They aren't uploaded yet 🙏🙏

[@kartikeyadubey1266]

Yes yes bhaiya , where can we find those notes.

[@ojasahirrao3287]

In the second step, 23 is less than 45, so according to your code they both should get swapped. How come 12 is getting swapped with 45? There is no code written to find the smallest number in [45, 23, 51, 19, 12]

[@ashutoshsagar837]

yes, no code is written to find the minimum here as according to the definition we have to find the minimum and then swap it with the beginning element of the unsorted array.

[@divyamharbola6876]

Everyone do like man, They are providing Platinum for free.

[@salahuddin13]

Time:[6:42] (Solution) #include using namespace std; int main(){ int tk,chocolates,total=0; cin>>tk; int wrappers=tk; total=tk; while (wrappers>=3) { chocolates = wrappers/3; // (14/3)=4 (6/3)=2 0 int rem= wrappers%3; //2 0 total+=(chocolates); //14 14+4=18 18+2=20 wrappers=chocolates+rem; // 4+2=6 } cout

[@uditangshuchakraborty3102]

thanks

[@tarunparashar4505]

Liked the video and was the first viewer without even being in college 😂😂😂. Btw class 12th student.

[@vaibhavagrawal6702]

Mam i think apne Selection sort ki coding me apne bubble sort ki coding btadi...

[@chirantanacharyya822]

Yeah you are absolutely right

[@ayushmaankashyap6788]

Very adorable voice mam🥰

[@aayshachouhan7985]

My Sir taught me in very difficult way ,but u make it easy..Thanks

[@parthpanchal815]

Bro this is not the correct code of selection sort it is bubble sort

[@rahulprasad3575]

selection sort code was different as it explained

[@sampadsadhu4371]

Yes I was confused at first

[@yashchauhan7221]

it is bubble sort which is shown in code not selection

[@chiragkakwani3174]

No 1 step has been missed

[@ramakp34]

@@yashchauhan7221 can u tell the code of selection sort

[@yashchauhan7221]

@@ramakp34 Ofcourse Dude #include using namespace std; int main() { int tot, arr[50], i, j, temp, small, chk, index; couttot; cout

[@nikitasharma2069]

For those pals who noticed that the code doesn't match with the explaination. Here's the correct code of selection sort: #include using namespace std; int main(){ int n; cin>>n; int array[n]; for (int i = 0; i < n; i++) { cin>>array[i]; } for (int i = 0; i < n; i++) { int min = array[i]; int loc = i; for (int j = i+1; j < n; j++) { if (min > array[j]) { min = array[j]; loc = j; } } int temp = array[i]; array[i] = array[loc]; array[loc] = temp; } for (int i = 0; i < n; i++) { cout

[@manthanpatil2268]

Thanks btw!

[@nikitagaikwad2788]

Thx dear

[@GULLAPUDILIKITHBCE]

what is the use of min variable? #include using namespace std; int main() { int arr[5]={3,4,2,1,-100}; for(int i=0;i

[@shaikwaseemahmed.5510]

Thanks date to date videos thanks aman dattarwal and team

[@anuragkumarsharma3926]

This code have one problem , We don't have to swap everytime when we get smaller number but only when we get smallest element in the unsorted array. according to the code output will be i guess {3,6,2,7,9}. Correct me guys if i am wrong

[@kashyapanuragi8987]

Ni bhai code sahi h Lekin lekin har baar swap karne ki jaroorat ni h, keval jab minimum mile tab short kar sakte the

[@user-nm4vn9tq5o]

Yes bro you are right, their code isn't working

[@usmanaliansari5223]

Code galat hai Selection sort ka

[@i_mchick5311]

we've only 15 RS. so we invested it to purchase 15 chocolates , then we purchased 15/3=5 more chocolates from wrappers . again from 5 chocolates we purchased 1 more ch leaving behind 2 wrappers. Total= 15+5+1=21 ch (2 wrappers left) Now tell me how can u purchase the last chocolate without having even a penny since u mentioned in the beginning we had 15 Rs only. ????? :)

[@_AKASHNAIR]

its mostly an error in their script ,and its acceptable they were trying to maintain quality content while without comprmising on time

[@meme-qw6hl]

Last chocolate wrapper+ 2 left wrapper =3wrappers=1chocolate

[@meme-qw6hl]

#Brain teaser# include using namespace std; int main() { int chocolate,price,wp; cin>>chocolate>>price>>wp; int c=chocolate/price; int eat=0; int m=0; while(c>0) { eat=eat+c; m=m+c; c=m/wp; m=m%wp; } cout

[@_AKASHNAIR]

@@meme-qw6hl so in the end only 21 choclates and 2 wrappers will be left right?

[@meme-qw6hl]

@@_AKASHNAIR no 22 chocolate and 0 wrapper

[@vinayaktripathi287]

For all comments on the point that code looks like bubble sort. More like she used bubble sort to get the minimum value for selection sort. The only difference was the starting point of first for loop which decreased time complexity compared to bubble sort.

[@shreyapanwar3800]

I don't get it why are you using "n-1" in the first for loop{for(int i=0;i

[@itshiraljain]

There is some mistake in selection sort code, we aren't optimizing no. of swaps, the correct code should be like this: for (int i = 0; i < n-1; i++) { int min = i; for (int j = i+1; j < n; j++) { if (arr[j] < arr[min]) { min = j; } } if (min != i) { swap(arr[min], arr[i]); } }

[@harharmahadev1038]

can you explain what you meant by saying that and this part... if (min != i) { swap(arr[min], arr[i]); }

[@itshiraljain]

@@harharmahadev1038 What actually happens in selection sort is that we have to find minimum element and swap it with the first element of unsorted array, i.e. all smaller elements will come at beginning in ascending order. Now if "min" is not equal to "i" it means that beginning element of unsorted array and min element are different that is why we need to swap both of them. swap function is present in bits/stdc++ library, u can simply include the library and use the function instead of taking temp variable...