সিলেকশন সর্ট - Selection Sort

[@abdullahbabor4876]

Thank You, Sir! I had a bit of confusion about the time complexity of the Binary search. Now it's crystal clear! Thanks again

[@mdpolassikder6384]

Best Programming Teacher

[@RahmatKhanZai89]

I would like to express my thanks to you, Tamim Shahriar, My gratitude for your indisputably magnificent assistance is almost infinite. Your efforts have not gone unnoticed. I really like your contribution that you have in our society, you really make a difference and help others out, the world could always use more people like you. Gosh, what a polite and humble fellow. It is such a kind honour for someone as low as me to be in contact with someone of a level such as yours. I thank you once again my good friend. A world without you, would be a world I would not be able to live in, and I believe I share that opinion with most people. I can rest easy tonight knowing you helped. I appreciate you and everything you stand for and on behalf of everyone on planet earth, thanks.

[@shiplu3941]

আপনার ভিডিও গুলো অসাধারণ ।ধন্যবাদ

[@RaiyadRaad]

ধন্যবাদ। আপনার ভিডিওগুলো থেকে অনেক কিছু শেখা যায়। তবে ভিডিওর সাউন্ড কোয়ালিটি আরেকটু ভালো করা যেতে পারে।

[@shuvshaw9594]

Very helpful.

[@promilaghoshmonty8700]

অনেক ধন্যবাদ ভাইয়া

[@chistyinfo]

Thanks, Shahriar bhai for your video tutorial.

[@parvejmosharaf8046]

such a great job

[@askmeanything-universityed3727]

অনেক ভালো লাগল

[@kamrulnaim2234]

Sir,if we run the loop from i=0 to i

[@ahmedfaysal4175]

n-1 element exchange korar por automatically sob theke boro digit ta last position e chole jabe, tai loop ta akbar kom use korleo hobe

[@mdjoynulabedin3542]

ভাইয়া , array.sort() / list.sort() থাকতে selection sort অ্যালগো‌রিদম কেন ব্যবহার করবো?

[@TamimShahriar]

selection sort অ্যালগরিদম আমরা আসলে ব্যবহার করব না। অ্যালগরিদমটা কিভাবে কাজ করে এটা শেখা দরকার হচ্ছে প্রোগ্রামিং লজিক বুঝার জন্য - নিজের প্রোগ্রামিং লজিক বাড়ানোর জন্য।

[@mdjoynulabedin3542]

@@TamimShahriar ধন্যবাদ ভাইয়া

[@sakhawatrudra1564]

Thanks

[@rimonmorad8639]

Thx vaia

[@mdmonir-xt6kr]

Vai boi koi pabo .. Boi ar nam ki .. ?

[@hmreza5246]

স্যার এই বই টি কি? বাংলায় লেখা??

[@abeerahmed7351]

Sir, I have simplified this code. Can you take a look, please?
int arr[5] = {2, 5, 3, 4, 1};
for (int j = 0; j < 4; j++)
{
for (int k = j+1; k < 5; k++)
{
if (arr[j] > arr[k])
{
int temp = arr[j];
arr[j] = arr[k];
arr[k] = temp;
}
}
}
By the way, your videos are very informative. Thanks a lot.

[@nazninnahar430]

Thank you so much

[@sumonfakir4942]

thank you sir

[@shamimsictitjobsolution5492]

Thanks.

[@altafhossain7793]

Umm I have a question .
In the time complexicity of selection sort the expression was
n+ n-1 + n-2 ... 2 + 1.
If we just add this thing , we would have some kn + constant .
I know I don't have to think about this when I am in math class but here , it matters , if I think this way my complexicity is O(n) ; why am I wrong ?
And , I might encounter same type of arguments as the programmes will be more complex , so I think its important ...

[@TamimShahriar]

The sum of this series is n * (n+1) / 2, which is n^2/2 and can be written as O(n^2). Please go through this proof - en.wikipedia.org/wiki/1_%2B_2_%2B_3_%2B_4_%2B_⋯

[@rijuwanahmed8742]

@@TamimShahriar
স্যার, এইটা মেইল ফাংশনে কিভাবে কল করে প্রিন্ট করতে হবে এইটা দেখিয়ে দিলে ভালো হতো।

[@bztherpr7764]

#include
int main()
{
int i, j, n, a[100], temp;
printf("How much number you want to write?: ");
scanf("%d", &n);
for(int i=0; i

[@user_BunnyAtNSU]

CODE:
#include
using namespace std;
int main(){
int arr[] = {5,3,6,2,7};
int i,j,n, index_min, temp;
n= sizeof(arr)/sizeof(arr[0]);
for( i=0; i

[@mehedihasan2261]

AMAR EI CODE TA KMN time comlexicity er dik teke
#include
void displayArray(int arr[]){
printf("The array is : ");
int j=9;
for(int i=0; i

[@shibbirahmad5313]

Thanks