Correction: Count sort is based on stable sort which means that relative order of values in original array should not be disturbed. So we can't directly print the array just by looking at the frequency of the elements . After storing the frequency of elements, we will update the frequency array by storing the prefix sum and then only we will form a new array of size equal to the original array and we will traverse the original array and store the values in the new array in accordance with the prefix sum .
Congratulations Brother....... 🎊🎉🎊🎉 You Rocks 🥰🥰🥰 Last but not Least Mera to Nahin Hua....... I'm accepting my defeat Like a King 👑 Muje to tabhi interview k time hi pata chal gaya tha Jab Chocolate khila kar bola tha Shaadi waadi Karo Abhi tumhari Age hi Kya Hai 😂😂😂
I am unable to get videos where time complexity is explained for Counting Sort and Radix Sort Sorting explanation is awesome please help to get related other vides
Sir hum apne junior ko suggest krte h aapki videos k liye but sir Hume aapke chhenal ka sahi s name yaad ni hota h ....plz name change krai chahe kol gate hi rakh lo😂
you are approaching one format okay your element range 0 to 9 only. but your approach never works all times. A=10, 8, 12, 9, 10, 11, 12, 10, 9, 8 this series never works your approach I can challenge you [23, 12, 34, 18, 25, 23, 19, 20, 18, 23], [2,1,1,0,2,5,4,0,2,8,7,7,9,2,0,1,9]. you fix the range 0 to 5 only. how is it possible these series?
I have a question... Why we write time complexity as O (n + k) always instead of writing actually values? Is tarah to har counting sort ki yehi time complexity hogi?
Yes, har counting sort ki yehi time complexity hogi. As Time complexity is a general association of an algorithm's worst case time to the input. Agaar n barega, to time bhi barega. Lekin time kitna barega relative with n, vo ha time complexity. Yahan time linearly n ke saath bar raha ha. O(n). Allag algorithms ki time complexity allag ho sakti ha, jaise bubble sort ki O(n^2).
![FNAF vs TF2 - Episode 2 [SFM]](http://i.ytimg.com/vi/z5b3V2-VLb0/mqdefault.jpg)
Told about your channel to my friend, now whole batch watches your video ✌🏻❤️
The title of the video 'Easiest explanation' is absolutely right.
Keep teaching us.
I was stressed when I didn't find this topic in your videos. Now, iam happy. Thank you.
Your college???
That is right 👍👍
After watching a lot of videos I got my doubts clear only by you sir. Thank you so much. 🙏🏻
Nice and clear >> Understand on 1st turn. better than apna college.
The thing I was trying to understand from days and you make me learned in few minutes. ALLAH BLESS you.
AMEEN
you are a genius sir....lots of love!
Explanation is very clear...Excellent. :)
True big brother
Allah aplogo ka bhala kre, Itna easily samjhaya, jo hamain University main samajh hi nai tha araha, Love u sir❤❤💯💯
Correction: Count sort is based on stable sort which means that relative order of values in original array should not be disturbed. So we can't directly print the array just by looking at the frequency of the elements . After storing the frequency of elements, we will update the frequency array by storing the prefix sum and then only we will form a new array of size equal to the original array and we will traverse the original array and store the values in the new array in accordance with the prefix sum .
Ya his method is not correct
But radix sort is stable sort
bro i didn't got ur point can u pls explain me
Yes, this method isn't correct Many youtubers use this method but it's wrong. My marks got deducted 😢.
ruclips.net/video/pEJiGC-ObQE/видео.html
You are a great teacher
I would love to train for GATE under you
Hope you will help
True
Yesterday I was searching for your counting sort video and couldnt find..and today you uploaded the video what a coincedence
Nice
Woahh, new board!! Congratulations sir :)
Ever Green Channel🙌❤
thankyou so much sir very good explanation
Prove helpful before exam's 2 hours ❤
DAA series..🤩
👏👏👏
Thanks for explaining.
Got selected in ibps so it officer with help of you thank you sir
Congratulations Brother....... 🎊🎉🎊🎉 You Rocks 🥰🥰🥰
Last but not Least Mera to Nahin Hua....... I'm accepting my defeat Like a King 👑 Muje to tabhi interview k time hi pata chal gaya tha Jab Chocolate khila kar bola tha Shaadi waadi Karo Abhi tumhari Age hi Kya Hai 😂😂😂
@@Eclipso619😂
@@Chaudharyhammad Kya kare Ab............. Mili hi Nahi Iss Rocky ko Uski Reena Koi 🤭
@@Eclipso619 mil jye ge bro don't worry Allah de ga
@@Chaudharyhammad Accha ........ Meri Tamanna Puri Ho To Fir........ 🥰🥰🥰 Dua me Yaad Rakhna 🤟🎯🤟
Sir Asslum-o-alikum , I like your lectures , so Sir plz made lectures on information security.
great explanation 🙏🏻
great explaination
842K 😍
On the way to 1M🎉🎉
Party Karna hainnnnnn sir jiiii 1M hone par...🎉🎉🎉
Where r U from.............. Brother,
Bangladesh Maybe 🎭
@@Eclipso619 Yeah Right I'm from BD!
Yes true ❣️❣️
hats off💕 love from pakistan
Welcome😊
Thank you so much
nice sir
Sir aapkaIntro song kisi aur website ka bahaut yaad dilata hai
happy teachers day sir
My all colleagues and students follow u
Wow sir Aap great Ho Aap ka asan kaise chukaye sir
Concept Clear
well explaind
bohot badhiya
how will it work if the rang is N and there is certain amount of inputs ..??
I am unable to get videos where time complexity is explained for Counting Sort and Radix Sort
Sorting explanation is awesome please help to get related other vides
please add some content and algorithm with it related topic
how will this works for negative numbers
Radix sort i thought very diffcult see ur videos beautiful
There are another couple of steps that make this algorithm stable.
First Comment
Great as Always 👍
mast algorithm hai
Sir u r great 💗🫶
video starts at 0:40 sec
this is different counting sort algorithm, but if we are getting marks in exams, then its good ig.
thankyou sir
forgot about posting radix sorts time complexity details.
Sir hum apne junior ko suggest krte h aapki videos k liye but sir Hume aapke chhenal ka sahi s name yaad ni hota h ....plz name change krai chahe kol gate hi rakh lo😂
“Varun Singla” name se share kar diya karo..
Ok
1st Comment............. 🤭
You Rocks Sir 🔥🎯🔥
Legends watching at 11:18 AM 🔥🔥
Good to see KL Rahul move to teaching line after his constant failures for India. 😊
Sir, if we have 10,25,22,15,18,21,24
Then what will be its range? And plz reply it's important
25
you are approaching one format okay your element range 0 to 9 only. but your approach never works all times. A=10, 8, 12, 9, 10, 11, 12, 10, 9, 8 this series never works your approach I can challenge you
[23, 12, 34, 18, 25, 23, 19, 20, 18, 23], [2,1,1,0,2,5,4,0,2,8,7,7,9,2,0,1,9]. you fix the range 0 to 5 only. how is it possible these series?
rewatch the video..its same as hashing
He said it works if it's in range , here he fixed the range as 5 hence it worked
space complexity will be O(n+k) na!
its a time complexity not space complexity
I have a question...
Why we write time complexity as O (n + k) always instead of writing actually values?
Is tarah to har counting sort ki yehi time complexity hogi?
Yes, har counting sort ki yehi time complexity hogi. As Time complexity is a general association of an algorithm's worst case time to the input.
Agaar n barega, to time bhi barega. Lekin time kitna barega relative with n, vo ha time complexity. Yahan time linearly n ke saath bar raha ha. O(n).
Allag algorithms ki time complexity allag ho sakti ha, jaise bubble sort ki O(n^2).
OG Varun Singla
Ciao @Varun Bhai, please rectify this video of yours. It's misleading.
What if array contains 0 or negative value.
For 0 it will work, but not for negative numbers as indexs are not negative
(N+K) or (NxK) ?
where is redix short next video sirji?
Subscribers bhut jarrori hai 🦾
completedgoodvibes
Sir pls send sell sort video link
people have put half an hour videos to explain this simple concept. 5 mins are more than enough.
bhai glt pdha diya h 5 min k chkr m🤣
@@amannegi8425 ohh, kya error h?
@@wisdomkhan this method only work for small integer.. But cannot be used as general purpose algo for sorting object with multiple members.
Legends are watching it at 12.53 am 😊
ok
Sir aap college exam , interview , competitive exam bol dete ho isliye jadatar bachhe dekh lete video 😂
Paid courses se better hai yeh
1:20
Are you teaching wrong or what???
How can someone explain in such an easiest way ....☺
Pgt haryana ki tyari kra do c and c++
Mujhe pta ha cs walo tm b dekh rae ho comment krna😂
Subscriber bahut zaroori hai
rahul dua
🙏🙏🤗🤗
This method is not correct sir correct it
dont speek subsribers bahut jaroori hai as we all know you are paid on the basis of subscribers
no, paid on the basis of views bozo
17/09/24 :)
bro why your video look like an english video but it's not? downvoted..
bhai tum lalchi bhot ho
17/09/24 :)