Harry I have watched almost all you videos in c , c++ and DSA and you have a really good, easy and understandable way of explanation for all the topics. But just one thing which i want to bring out is that there are few videos involving recursion where you have just mentioned the procedure but i think it would have been better if you could take a few more minutes to explain the recursion tree and how the process is actually taking place which could enhance the concept for these topics
Hi, I am learning python through your playlist. I have seen many python books from many writers. I just want that my teacher - the one who is teaching me python none other than "HARRY SIR". You know many programming languages so I request you to write a book on python in a simple way as your teaching style makes difficult things easier and I am sure that if you write a book on python it will make much easy for us to learn it. SALUTE YOU SIR FOR PROVIDING SUCH CONTENT AND THAT ALSO FOR FREE HOPE YOU UNDERSTAND MY WORDS AND WILL WRITE A BOOK FOR YOUR STUDENTS
The best part listening at 2x speed was"Tadah...Game over! What happened?. Array did not get sorted"😂😂😂 . But jokes aside, this Playlist is really motivating me to watch 4-5 videos per day🎉🎉. Thank you Harry bhai🎉🎉
it was a grt video, u made all this stuff easy thank u....keep the videos coming ill be waiting for the next one concepts r so easy well this is out of topic Please make a course on Angular and Ionic too later when u finish this thank u
If low = index{3} and high = {4} Space required for merge = 2. So we get this space in array by [(high-low) + 1] -> (4-3)+1 = 1+1 = 2. Hence we need an B[2].{Array B of size 2} e. g Array = {1, 2,3,4,0,5,6,7} Low= 0 th index. High = 7 th index. A{1,2,3,4} and B{0,5 6,7} Index for A=(0,1,2,3) and index for B=(4, 5,6,7) To merge A and B. We need array of size = ?. Size = (high-low)+1 = (7-0) +1= 8 Hence Array C = C[8] ={ Arrya of size 8 = indices->0,1,2,3,4,5,6,7}
sir very good video thanks a lot but sir please mein last char video se keh rahan hu ki C# full tutorial series banado please par aapne koi reply nahi kiya sir please
When you say we should write code on our own, should we write the code alongside your video, or first see the video then try to write the code from memory. Thanks
harry bhai bhot baar asaa hotaa ki vedio kaafi baar repeat krne ke baad kuch douts rh jaati h. jse jo out put hum expect krte h voo nhi la patee. plzz kuch asaa kro ki hum app se intract kr paaye fir chaye vo paid he kyu na ho. plzz give as a platform jaa hum apni dout put kr ske :)
@CodeWithHarry Brother, you did not talked in detail about merge sort like it's best case & worst cast like kinda you did for all the other sorts & not even talked about it's analysis mainly adaptive & stability?
Is video ke baad to mergesort 100 nahi ekdum 1000% clear ho jaega!
Vs code debugging video jarur bnana
Harry Bhai Hum Jo Aapki Webite Pe Dale Contact Me Pe Usko Padke Usko Reply Bhi Toh Kiya Karo Pelase
Harry bhai notes toh do
Haan Harry bhai 10,000% samajh aa gaya.
Plz a video on visual studio
The amount of satisfaction I get after understanding concepts .....it just cannot beat anything
Bhai harry padhate toh sahi ho tum but more over insaan ache ho thoda positive lgta video dekhke aapki. Thanks bhai.
One of the most talented boy "HARRY"
I request you to complete this playlist as fast as possible... Pleaseee !!!
Notes Complete nahi he....😭😭
Half notes nahi ha...
@@supriyahaldar2175 notes ke liye kya ro rha hai, jab codes pure likhaye hai, aur kya chahiye 🤦♂️🤦♂️
Harry I have watched almost all you videos in c , c++ and DSA and you have a really good, easy and understandable way of explanation for all the topics. But just one thing which i want to bring out is that there are few videos involving recursion where you have just mentioned the procedure but i think it would have been better if you could take a few more minutes to explain the recursion tree and how the process is actually taking place which could enhance the concept for these topics
recursion is taught in C language, so i think thats not neccessary to repeat it due to time constraints
I am so much excited coz-
*We are so much close to one MILLION subs*
🔥🔥🔥🔥
Hope that happens soon
I'm learning programming by seeing your videos..........
Thankyou so much👌👌🙏🙏🙏 ......
Bro. You are my first teacher in program learning
tantannnn....game over really 🤪🤪
Thanks sir, i was struggling with this topic since the last week, thankfully your video made me understand this concept easily, thank you again
Awsm harry bhai🙌🙌
I request you to please complete this playlist as fast as possible, please.
jaisa aapka hukum mere aaka
Absolutely loved this one and the previous video.
Your explaination was 100 times better than Apna College.
6:07 The moment he said get get get low when the whistle blows...... music instantly starts playing in my head 🤣🤣
Harry bhai you deserve 1000 million you are the best first viewer
Hi, I am learning python through your playlist. I have seen many python books from many writers. I just want that my teacher - the one who is teaching me python none other than "HARRY SIR". You know many programming languages so I request you to write a book on python in a simple way as your teaching style makes difficult things easier and I am sure that if you write a book on python it will make much easy for us to learn it.
SALUTE YOU SIR FOR PROVIDING SUCH CONTENT AND THAT ALSO FOR FREE
HOPE YOU UNDERSTAND MY WORDS AND WILL WRITE A BOOK FOR YOUR STUDENTS
very informative video specially ninja hattori wala part 😂😂😂😂
maje aa gaye harry bhaiya
dil se accha lagta h aapse padke
What a great video Harry Nahi🤘🤘👌👌
Ur really doing a great work hats off to u harry sir!!!
Thank you very much, you have eased our life very much. Thanks to Allah for letting me study with you.
brooooooooooooooooooo video dekhne ke bad 1st attempt me hi correct code likh diya well explained
Best video to understand ❤❤❤
I have just recived your notification right now
big fan of your teaching skills...
ninja hattori
you are amazing harry bhai 😂😂🤣💕
😊 Thanks for explaining so well 😊
ThankYou CodeWithHarry, Merge Sort is implemented successfully.
Goat=harry bhai❤❤
Aap bhot acha study kra te ho sir
Bhaiya merge sort algorithm ek stable algorithm he to code men thoda changes karna hoga (in place of A[i] it should be A[i]
Salute to you Harry bhai you the best bhai !
This video is very helpful.
thank you harry
The best part listening at 2x speed was"Tadah...Game over! What happened?. Array did not get sorted"😂😂😂 . But jokes aside, this Playlist is really motivating me to watch 4-5 videos per day🎉🎉. Thank you Harry bhai🎉🎉
Bhai bhot zhar video dala h
I request you to please complete this playlist as fast as possible
@ManKura 😂😂😂
Bro U have not uploaded the remaining part OF DSA-> tree, graph
it was a grt video, u made all this stuff easy thank u....keep the videos coming ill be waiting for the next one
concepts r so easy
well this is out of topic
Please make a course on Angular and Ionic too later when u finish this thank u
Clear as Sprite
I suppose you could have made it stable by using the less than equal to operator in A[i] < A[j] inside the argument of while loop.
you make things simple sir
Harry bhai please make a video of "Analysis of Merge Sort "- how values are stored in stack and fetched.
youtube me padte smay aisa lagra hai llive pdre ho comedy bhnkr sahii hai harri bhai🥰
thank you bhai ji making this easy
Continue this course till the end Harry sir
Thanks alot for this video!! 😊
Really helpful video! I can finally write a Merge Sort program without any help.
greatt explanation sirr
Etna easy keyoo hah bhi Marge sort algo?
bhout accha see samaj mee agya
Thank you for the informative video. It would have been helpful if you could add a video for time complexity & Analysis calculation for Merge Sort
we can do
int mid=L+(r-L)/2
when items of array is 8 digit or more then 8 digit??
Bhai 10,000% samajh aa gaya.
Please complete this playlist as soon as possible !!!
Marge is very nice sorting
18:40 i still can't understand how it is High - low +1 can you please tell me in more easy words
If low = index{3} and high = {4}
Space required for merge = 2.
So we get this space in array by [(high-low) + 1]
-> (4-3)+1 = 1+1 = 2.
Hence we need an B[2].{Array B of size 2}
e. g
Array = {1, 2,3,4,0,5,6,7}
Low= 0 th index.
High = 7 th index.
A{1,2,3,4} and B{0,5 6,7}
Index for A=(0,1,2,3) and index for B=(4, 5,6,7)
To merge A and B.
We need array of size = ?.
Size = (high-low)+1
= (7-0) +1= 8
Hence Array C = C[8] ={ Arrya of size 8 = indices->0,1,2,3,4,5,6,7}
best explanation sir.
Sir plzzz post vedios on graph as soon as possible
Waiting for next video ❤️❤️
Thank you so much Sir
Please make a advanced c++ course also
sir apni puri bio pe ek video banao full bio
Love you bhai 😍
Thank you so much sir ❤️
sir very good video thanks a lot
but sir please mein last char video se keh rahan hu ki
C# full tutorial series banado please par aapne koi reply nahi kiya sir please
Please make a video on gsoc. Everything about it. It will be very helpful.
Yo .... DS is back 😍
Sir sayd yumico ko kenichi le jayega kyuki kenichi ke sath hattori hai 😂🥷
Tq so much bro helped me a lot
Sir Please complete this Playlist as soon as possible
Harry bhai at 11:40 there you forget to copy again elements of B array to A array
0:15 yumiko ko amara set kr lega 😂😂😂😂
Sir micropython bhi sikha do, i love the way you teach.
Thanks Harry Bhaiya
➡️I never watched ninja hatori
But loved to watch ninja HARRY❤️❤️❤️❤️
Big fan sir please reply ❤️
Sir please complete this DSA course 🙏🏻😁
And thank you for this video
I clearly understand the merge sort 🙏🏻😁😉🤗
jindabad-jindabad.....harry भई jindabad.🕺🏻
hamara teacher kesa ho?....harry भई jesa ho🙏🏻🙏🏻🥂🍾
Sir also can you please make complete tutorial on Linux..... Please🙏🙏
Perfect 👍👍👌👌
Mr. Harry can you make a course on C# ? please!!!!!!!!!!!!!!!!!!!!!!!!
thanks_Sir💜⚡️
tan tana!!
game over XD
I love ur teaching methods sir ❤️❤️❤️
Please give me ❤️
complete this course plzz 🙏
Sir start course of XML
I request you to complete as soon as possible plse 🙏🙏
Harry bhai plz make videos of graphs and trees also ASAP.🙏
Harry bro ye bta do trees or graphs playlist m cover karaoge??
Vs code debugger pe video bnao
Java ka course bhi complete krna sir please...
When you say we should write code on our own, should we write the code alongside your video, or first see the video then try to write the code from memory.
Thanks
Firstly a month ago I saw first video of this channel and I thought that carryminati started teaching coding
🤣🤣
Sir, there is no vedio for radix sort in this Playlist. Can you please make a vedio on radix sort.
Ninja hatori😀😀😀9:36
Please make more videos on Django🙏🙏🙏
harry bhai bhot baar asaa hotaa ki vedio kaafi baar repeat krne ke baad kuch douts rh jaati h. jse jo out put hum expect krte h voo nhi la patee. plzz kuch asaa kro ki hum app se intract kr paaye fir chaye vo paid he kyu na ho. plzz give as a platform jaa hum apni dout put kr ske :)
@CodeWithHarry Brother, you did not talked in detail about merge sort like it's best case & worst cast like kinda you did for all the other sorts & not even talked about it's analysis mainly adaptive & stability?
Sir I just Wanted to ask you that do you also know ethical hacking?
If you know then please make tutorial on Ethical Hacking.........
Hello Harry bhaiya ..
Hashing pe video bhi upload kijiye