1)Non Comparison 2)Different From All Sorting Strategy it does dont compare and sort 3) Radix i.e (Base) 4) focus on LSD (least significant digit)&MSD (Most Significant Digit)
Algo:::COUNTING_SORT_BY_DIGIT(array, n, digit): // digit = the place value (1 for units, 10 for tens, etc.) 1. Initialize count array of size 10 with all zeros (0 to 9 for decimal digits). 2. Create an output array of size n. 3. For each element in the array: a. Extract the current digit: index = (array[i] // digit) % 10 b. Increment count[index]. 4. Modify count array to store cumulative sums: a. count[i] = count[i] + count[i-1] (for i from 1 to 9). 5. For each element in the array (in reverse order): a. Extract the current digit: index = (array[i] // digit) % 10 b. Place the element in output[count[index] - 1]. c. Decrement count[index]. 6. Copy the output array back to the original array.
But sir i think its the worst sorting algorithm as it sorting the same number many times ya jts decreasing after LSB sorting bjt still its more time consuming than others
1)Non Comparison
2)Different From All Sorting Strategy it does dont compare and sort
3) Radix i.e (Base)
4) focus on LSD (least significant digit)&MSD (Most Significant Digit)
Thnx
Great as Always 🙋
@@Eclipso619 kaha?
Alright 😌
हर हर महादेव जय माँ भवानी जय श्रीराम जय माँ सीता जय हनुमानजी 🙏🙏🙏🙏🙏🙏❤❤❤❤❤🚩🚩🚩🚩🚩🚩🚩🚩🚩🚩🚩🚩
Kindly upload its time complexity part as well. Thanks.
lululullululululullululullulllululullu
What the hell, who made this algorithm was a genius💀
Sir great work best teacher I have ever learn from 🙏
Very nice sir ji. Thanks for this useful video
Subha agr Mera paper acha hoa to wo Sirf aap ki wajah sy Hoga thank you sir Allah pak apko salamt rakhy
konse university ka tha?
You r the best!!❤🤩understood it very clearly..
Superbbb sir i understand perfectly
Thank you so much sir... 🙏
Best explanation ever😍
Watch in 5x
5x per sunai nahi deta bro.... 3x max
@lakshyachaturvedibtech2492Mod yt pr hai
@lakshyachaturvedibtech2492 To phone bechdo aur naye phone lelo aajayega.
🥲
😂
Thank you so much Great work again Thanks A lot Sir!
I really like you bro
I learnt operating systems from you
Will be writing finals soon
Thank you so much
PLEASE....
Guide us for GATE 2023
Count me in, I am competing with you : )
Result
good explanation
sir 💯
Thank you for the video sir 😊
Thank you sir, really very helpful video 😊🙏
Thank you so much sir ❤Best explanation 👍
Thank you!
Awesome 😎.... I was in need of it ..
Good effort sir g
Best as always❤
thanks for teaching
Thank you so much🎉
Thanq sir this video is very helpful for me ❤Thanq
Thank youuu sir🙏
Nice
Thank you so much sir 🙏
🤟🎯🤟
@@Tamanna_K_Hardy Hide hai ab 🤟
Thanks
Thank you bro so much
Thank you❤️
Sir that was Shocking 😊😊. Really a great explanation
Awesome Explanation Brother
Very useful video
Exam Tomorrow 😅
😅 same bro
Same😂
Exam in just after 10 min 🐻❄️
Love u ho gaya sir ❤
nice one 🙏🙏🙏
Thanks 🔥
at 2:40 how are we supposed to find smallest number from least insignificant bit without comparing??
thankss a lot sir
Very well explained
thank you sir
Thanks sir ❤
Amazing👍
Subscriber Bahut Zaruri Hai😊
thanks
I am watch first time any video normal speed and second time watch 1.75x speed 😅😅 thankyou sir.
Sir you are like GOD when a computer science student want to crack any exam 🙏🏻🤍
Thank you
ThankYou soo much
How i can contact sir
once again I am watching this channel for knowledge
Thank you sir.
Sir iski puri playlist kaha hai
Very helpful
good video
Thanks bhaiya
Thank you sir for videos
Sir please software project management par videos bna do....
Because your videos are very helpful to us....
sir,
please give me your algorithm playlist
i cant find it
Thanku Sir
thanks bhai
I don't understand why we're starting from LSB. Why not MSB? wouldn't it sort rapidly if we use MSB instead of LSB?
Sir radix sort ko array index se solve kar na hai
Sir can you make lectures on information security?
Sir exam me sbse jyada kaun si sorting algorithms puchhi jati h
Very easy thank you sir 🙏🏻❤️
subscribers bahut jaruri hai
Why it is non comparison based algorithm
even though we are comparing every single digit of every number
. can you please elaborate this,
we are not doing comparison we are arranging it in ascending order according to their number
Done 🙏🏻🙏🏻
Sir please radix sort next part time complexity share
Sir exam me radix sort me question kaise puchhe jate h
Ye topic basic comp instructor m ana kya
Sir g algorithm b to sath btaya kry plz
Sirji plz give me this pseudo code
Sir or kitna lamba hoga ye series
🔥
Sir please teach in English i can't understand hindi but your video found best for dsa that why i am asking sir
What will be the code of this logic
0:45
lekin apne to shell sort to kiya hi nahi
Tx u sir
Radix sort part 2 video for time complexity kha h???
Sir in semester exam how questions will given ??
ok
But the limitations is floating points :(
❤❤
My exam tommorrow
Plz provide with eng subtitles sir it will be helpful to all other students
Subtitles are available on this video buddy
completed
❤
I have exam tomorrow
Thank you 🥺
Go and study
Algo:::COUNTING_SORT_BY_DIGIT(array, n, digit):
// digit = the place value (1 for units, 10 for tens, etc.)
1. Initialize count array of size 10 with all zeros (0 to 9 for decimal digits).
2. Create an output array of size n.
3. For each element in the array:
a. Extract the current digit: index = (array[i] // digit) % 10
b. Increment count[index].
4. Modify count array to store cumulative sums:
a. count[i] = count[i] + count[i-1] (for i from 1 to 9).
5. For each element in the array (in reverse order):
a. Extract the current digit: index = (array[i] // digit) % 10
b. Place the element in output[count[index] - 1].
c. Decrement count[index].
6. Copy the output array back to the original array.
But sir i think its the worst sorting algorithm as it sorting the same number many times ya jts decreasing after LSB sorting bjt still its more time consuming than others
3:33
Watching a hour before exam😅
Ye video "ittu sa" tha 🙇😐
Exam Today after 1 hour 😊
Exam 2 hrs later 😢
LSB bhi to compare ho hi rha h
Monday ko exam Hy 😢😢