12:43 you can use calloc instead of malloc, if you use calloc then you don't have to set every element value equal to 0 because the compiler will automatically set all the elements in array equal to the 0
Where you all were during the 4 years of engineering and now relying on others courses for your job interview. Are you all passionate about your career or not .
Instead of using malloc() we can use calloc(), calloc() will initialize the allocated blocks with zero and we don't have to do it using a loop manually.
Counting sort is typically designed for non-negative integers because it relies on indexing into an array. However, it can be adapted to handle negative numbers by adjusting the range of the count array
Hello Harry brother.. In your "complete roadmap" playlist, you said well about data science... What if we target, machine learning(ML) or artificial intelligence(AI). Please make a video for the roadmap for those targets as well. Searching on google is bit difficult, as it does provide the exact answers we want..... So PLEASE....... a request to you....
Priniples of recursion, tail recursion , removal of recursion, fibonacci number, hanoi towers, tradeoff b/w iteration and recursion, problem solving using iteration and recursion such as binary search yeh sb topic bhi bta do harry bhai
sir please make sql series...muje bht man h seekhne ka aur aapke hi code smjh ate h bus..plz sql series i know hectic h apke lie par isko consider karna bhai plz
I was born just 2 minutes ago and doctor showed me this video and i understood count sort. Thank u Harry bhai.🙂
😂
logic to hai........🌍😃
same mere sath bhi hua😀
You're 6 months old now. 🎉
@@thicccatto3956 7 months 🤣
BHAIYA JI ..
AAP EK AISA KAAM KAR RAHE HAI .
JO KI LOG PAISE LE KAR BHI DHANG SE NAHI KARTE.
GOOD CODING TUTORIAL.
LOVE FROM UTTAR PRADESH
@@YashMaheshwari_15_85 bhai itne nhi milte.
@@yogeshbisht8306 my only point is that "No one work for free".
@@YashMaheshwari_15_85 just shut up your mouth.........if you comment any UA-cam video.......u pay????????
@@arponkumarchowdhury2813 Bro I m typing not speaking, so plz think before u type😏
@@arponkumarchowdhury2813 And commenting a video is not a big deal for which I should pay
12:43 you can use calloc instead of malloc, if you use calloc then you don't have to set every element value equal to 0 because the compiler will automatically set all the elements in array equal to the 0
i agree with you
you are so smart
@@officialgamer285 Agree
Yehi maibhi soch raha tha😅
please complete the course as soon as possible.
you are amazing, your way of teching is very perfect and fun. thankyou for making such amazing videos
Sir please requested you to complete this Playlist as soon as possible
Sir maine aapka pura video dekha DSA and java
Very helpful for me thanku so much sir
we have interview soon, upload all data structure vdos as quick as u can
Same here bro
Please lagate h bhai
SAME
Where you all were during the 4 years of engineering and now relying on others courses for your job interview.
Are you all passionate about your career or not .
@@souled_blink Gyan mat dijiye
Awesome explanation!
Our exams are gonna start within a week or two... Can you please complete this playlist before other!! Please!!!
Yaah pls sir ... complete the course
the best simplest explanation bro ,keep doing it you are gonna achieve great success, i feel strongly and pray for u
concept is easy but code is very logical, and i solved it in a same way before watching your answer superb
Your videos are really very helpful. Pls sir upload videos daily so the continuation will not break. I hope you can understand.
Thanks for this wonderful video. May gbu with lots of success love and life. Keep Rocking
Harry Sir, You are legend in Programming
Take a bow
bhai waiting for the next video, please post soon! love from Bangladesh
this way is the simplest, I have seen a couple of videos on count sort, and I only understood the concept when I saw yours , thanks
Harry bhai thank you ❤️ for this data structure course
Please data structure Ka course jaldi Pura Kar do
bhai ds algo videos ki frequency ko please thoda badha dijiye because you are the best among others on youtube
ekdum perfectly samjh me aya. I was struggling a lot to get the logic but now it is crystal clear. Many thanks to you sir .God bless you🙂🙂🙂🙂💕💕💕
Bhai apka vidio itna itrusting hota he har chiz smj aa jata he thaks for help full vidio bro... Big fan of you.... Keet it..
yaar bahut acha kaam kar rahe ho bhai,hash table ke bhi dalo bhai video
Sir, you make it so easy-peasy to understand . Thank You So Much 😍😍
plz upload trees concept as we students have our final exams in December. Highly appreciated.
Harry bhai it's because of your teaching which makes it easy nursery concept
Instead of initialing zero for each index we can write ,
int count[max + 1] = {0} ;
it works fine !
thank you harry
I'm to failing to visualize how this algorithm works. Could you please help me with that?
Instead of using malloc() we can use calloc(), calloc() will initialize the allocated blocks with zero and we don't have to do it using a loop manually.
...bro please Please complete DSA playlist as soon as possible , bcz this is very important for interviews, other things we can learn later
Very Good Quality Content. thanks from Bangladesh
Get well soon harry bhai.✌️
Bohut mast tha count sort..✌️✌️
Nursery me count short pad sakte hai par teacher Humko Harry bhai chaiye 😎😎😎😎code with Harry is best....! ☺
Android Development Course With Notes
Counting sort is typically designed for non-negative integers because it relies on indexing into an array. However, it can be adapted to handle negative numbers by adjusting the range of the count array
Ye to super asaan h !!
5 minutes pahe jnma bacha vi sikh jaega count sort. Thanks cwh!
wow bhaiya...superb explaination..maaja agaya :)
Brother what if there is a negative element in array
Boht sahi explanation dete ho yar aap bhaiya. Maza aagya 🔥🔥
This is very simple , even a nursery class kid can count the numbers and tell how many times they are present in array
10:39 u can even do int max = sizeof(int); it also works
sorry, u can use max()
Harry brother really you are awesome... I got a job after learn your php tutorial ❤️❤️❤️❤️❤️💋
Hello Harry brother..
In your "complete roadmap" playlist, you said well about data science...
What if we target, machine learning(ML) or artificial intelligence(AI). Please make a video for the roadmap for those targets as well.
Searching on google is bit difficult, as it does provide the exact answers we want.....
So PLEASE....... a request to you....
HEllo brother....
what are you doing now.
Have you achieved your goal.
please reply :)
can we use first element max = A[0] instead of using max = INT_MIN ?
I think A[0] can also be used
You're right any random garbage value also works.
this video helped me alot .....thanx harrry bhai
Priniples of recursion, tail recursion , removal of recursion, fibonacci number, hanoi towers, tradeoff b/w iteration and recursion, problem solving using iteration and recursion such as binary search yeh sb topic bhi bta do harry bhai
Amazing Bhai ♥️
13:33 we can also use calloc to avoid next for loop and dynamically assign to Zero in all index. isn't?
yes we can.
Yup👍🏻
Yaa
Sir i have completed till now all vedios and plss upload all the vedio directky so that we can learn fast as we have test of company
Your doing great work buddy .. thanks ...Keep it up
Wonderful video bhaiya ji
Bohot hard teaching
Please complete DSA playlist as soon as possible , bcz this is very important for interviews, other things we can learn later
very easy after your explanation
1st comment harry bhai. Please 1 💙dy do.
U are the my Fevrat 😍teacher.
And i love last music🎶 end of the video vale. 😂😂😂
Thank you❤
You changed my life thanks 🤗
Bahut easy !!!!
raaaaapchikk explanation bhai..
I am in nursery class sir and I fully understand it thanks sir💜⚡️🤘
Please complete this course as soon as possible
Owsome video ,
Harry bhai radix sort pr video bnavo na plz
12:38 we can use calloc to avoid 'for' loop and every element of count array will be automatically initialized to 0.
super brother , using callloc would be more better 🔥
super asaan hai bhai ....
i am very exited.........
Hlo harry bhai mene apka python wala course dekha tha aur ab mein 55lks per anm kibsalary per hu in n core games making fau g
sir please make sql series...muje bht man h seekhne ka aur aapke hi code smjh ate h bus..plz sql series i know hectic h apke lie par isko consider karna bhai plz
it is too easy bcz of you.......
Thank you Harry bhai.. Very nicely explained
Harry bhai I'm your big fan from sindh pakistan
Harry bhai DSA ki playlist end tak leke jao pls sbse important topic hai......
This is super easy 👌👍
kadak , maja aa gaya :)
Bhaiya trees ka bhi video upload kijye!!! Please 🙏🏻🙏🏻🙏🏻🥺🥺
really easy , thanku harry bhhai
Harry bhai tussi great ho
Goat=harry bhai❤❤
Harry bhai ..ek video difference between angular and angular js pe bhi banao and if possible dono ke tutorial series bhi bana do please
10:40 Can we use max = A[0]
Yar ye count sort to nursery me padhana chaiye tha😂
Bhaiya mei IIT ROORKEE se hu aapka shukriya
Thanks harry sir for telling us about cout sort
Thank you sir.... You are the best
Hello Harry Sir ! Good Morning...
Best explanation ever !
Thank You So Much Brother
Thanks Harry Bhaiya
Sir video is awesome sir sir one more thing sir can u please make a video on how to do digital marketing please sir requesting you sir🙏🙏🙏🙏🙏🙏
bro please Please complete DSA playlist as soon as possible , bcz this is very important for interviews, other things we can learn later
sir gajab thanks for every thinks....
Thx ❤❤ Harry Bhai
asan h nursery class k bacche ne muje vs code me implement krk diya
It's very easy
very good
Please complete course of dsa really need it
Thank you Harry bhaiii
Harry big brother please make videos on BST and its operations like tree traversal, find a node, inorder, preorder, postorder and delete a node!
very helpful tutorial keep it up sir
Make a video on Radix sort
Nice explanation
Harry sir please also make a video in dynamic programming, graphs and hashing that are also important for interviews
bhi ya to such mee bhout hee asan heh
Sir please complete this series
Meanwhile, Harry Bhaiya After Explaining every topic with ease:- "KA KAROON MAIN ITNA EASY HAI TO, AAP HI BATAO KA KAROON?"😅😅😅
Thank-you !