Selection Sort Algorithm | Code & Time Complexity | Data Structure & Algorithm | Bangla Tutorial

[@codesheet4750]

বাংলা ভাষায় এমন অনন্য অবদানের জন্য অসংখ্য ধন্যবাদ
টাইম কম্প্লেক্সিটি টা বিশেষ করে দরকার ছিলো ।
অসাধারণ আলোচনা ।

[@shahriarchowdhury5582]

You deserve more viewers and subscribers, brilliant man❤️ go ahead

[@md.tanvirahmed9529]

খুবেই উপকার হলো ভাই,,,, ইসলামী বিশ্ববিদ্যালয়ে থেকে দেখছি

[@tohfa7797]

I really can’t thank you enough for such interactive content. Found your video at the perfect time when I needed the most. Go ahead

[@ishratjahan-cr7lh]

Thank you vaia...apner video dekhe exam disi Alhumdulilallah onk vlo hoise

[@mdminhaj8567]

You're great! Awesome lecture! Thanks to you for this video.

[@sumanjana1963]

Sir I am very happy
For your help
All doubt is clear.
Many many thanks 👍

[@nigarsultana1739]

Thank you sir for helping me understand this sorting algorithms.

[@sozibrayhan1622]

very good ,thanks

[@mdsumonmia7800]

Thank you so much. Dear brother ❤️
Concept fully clear!

[@md.robelahammed5137]

I think swap er condition ta second for loop er bahire hobe bro.... swap er condition 2nd for loop er betore howay if(a[j] < a[min]){} ai condition check korar por kintu j er value increament na kore if(min ! = i){} ai condition check korbe ,, .... r swap er conditon ta 2nd for loop end howar pore ee drkar... thanks for your nice tutorial

[@ronihossain7428]

Very informative and helpful video😍😍😍

[@FarhanHossan]

Please share it to your friends

[@rashed_haq]

khub shundor explanation❤❤

[@thekahaf]

Thank You Vhaia

[@STaSin-so5sj]

Correction: The second for loop will end before second if ( If(min!=i) )...

[@STaSin-so5sj]

for (i = 0; i < n-1; i++) {
// Find the minimum element in the unsorted part of the array
min = i;
for (j = i+1; j < n; j++) {
if (arr[j] < arr[min]) {
min = j;
}
}
// Swap the found minimum element with the first element
if (min != i) {
temp = arr[i];
arr[i] = arr[min];
arr[min] = temp;
}
}

[@rubyslifestyle7719]

great

[@sabikunnahar585]

Thank you so much.

[@nusratjahanbindu3359]

I have a doubt.it-2 te 13 to 9 er shathe swap na hoye 11 er shathei swap hoye jete parto.tokhon to condition ta thik thakto na,,,,atar ans den plz...

[@turagwilson1982]

Attributes of the selection Sorting Algorithm and their explanation (eg. adaptability, offline/online, etc.)
can you please explain it ??

[@rashed_haq]

thanks...❤❤

[@csebangla3618]

bolchi dada jokhn pass 1 er por
array ta 2 13 15 11 9 chilo trpr to ebar 13 ta k dhore cholbo kintu o jokhn compare korte thakbe tokhn to dekhbe 11

[@monirulislam7860]

thanks lot off.

[@muna6831]

aro vdo chai bhaiyaaaaaa

[@sumanjana1963]

Sir please 🙏
You will explain this concept of any program same types
I mean you will explain by the note book ,use the writing by pen and notebook

[@ashraflaam3400]

sir apni ki UAP tei faculty hishebe achen?

[@pialhasan4550]

best chilo kintu code pc te korle onk valo hoto vaiya besta DS playlist bd

[@cloudnumbernine1421]

Lovely

[@ariyanpritom9071]

Outer loop a n-1 holo. but inner loop a n holo kano.? n-1 holo na kano??

[@learnikramuldiu9773]

Wonderful

[@BroskeyBDEsports]

sire, can u give a ms word file for this code?

[@sabikunnahar585]

Thank you so much

[@ayonballav1904]

Thank u💚