Selection Sort Theory in Java | DSA

preview_player
Показать описание
Check out our courses:

Coupon: TELUSKO10 (10% Discount)

Coupon: TELUSKO20 (20% Discount)

For More Queries WhatsApp or Call on : +919008963671

Udemy Courses:

Рекомендации по теме
Комментарии
Автор

This is what animals with explanation is required for teaching 👍👍👍👏👏👏

naveenalla
Автор

In bubble sort, I noticed that largest value is moved to the last place at the first loop, that's why we don't need to loop til the end, so the condition is j < arr.length - i - 1. I don't see much different between these two types of sorting.

cityrunner-xx
Автор

Please complete this DSA playlist as soon as possible sir in future is going to help a lot of students.

CandyCrush.
Автор

it's easy to put the value at starting because of index number . this selection theory looks weird why do we assign the value at the end?

subhajitlucky
Автор

When I saw the thumbnail I thought it was Jailson Mendes 😂

pavaneli
Автор

Sir plz write one program and explain it

v.chandrasekharchandu
Автор

Sir why you are doing only Java with DSA, pls do python DSA Sir

reddyryals
Автор

i wonder if he's a software engineer from MIT (Massachusetts Institute of Technology) or IIT (Indian Institute of Technology)🫡💀

abhijaiallgamesgamer