I may sound stupid but I literally cried when she started explaining the mechanism behind the algo in detain. This shows how bad our universities and colleges are, and the amount of trauma, so carelessly they burden us with. Thanks a lot, ma'am. you are a true legend.
Me too in the selection sort video like why nobody explain the tracing, my teacher just do it so quick and I can't get it at all even when I search in UA-cam nobody explains the tracing part and the applying part is so easy like people we know how to replace numbers explain the hard part !!!
i was literally shocked that how much efforts you're putting in one explanation and giving this precious content for freeeeeeee !! your lectures are so so so important for our understanding || thank youuuuu sooooooooo much || please never stop making videos !!
I agree i saw many videos however i struglled while implementing the code.This one cleared all my doubts 36 min video is better than a 6 min animation.
How she explains with a simple whiteboard with limited spaces are far superior than 6 min fancy animated videos that leave you with nothing after watching.
I used to have a physics teacher who I always told that he was born to teach because he explained concepts so well and made it impossible to not understand. You fall into that category Ma'am. English isn't even your first language and you explained the merge concept beautifully. I understood the pseudo code 100% too. AMAZING work. Thank you, your videos are the only reason I will complete my degree.
Its rare to see teachers explain each step of a recursive example in such detail. You've explained it right from the beginning to the end taking into account each small step along the way. Amazing mam! People will start noticing your efforts and your channel will grow like anything. Much ❤️
@@shopeofediting4952 you dont have to copy the elements you can just print the array b[] but if you wanted to do it anyways then this is the code: a[n] is the initial array of size n and b[n] is the sorted array of size n for(int i = 0;i
If someone facing issues with sound with any video in youtube, and then he/she downloads to watch that video, then imagine the quality of the video. Respect mam.
if someone searches for a video to understand what is really happen when u call the MergeSort function, I think this the best video for you, and nobody can explain it in detail like this Thanks so much, your work is appreciated ❤
Your impeccable way of teaching is speechless. Thank You So Much Ma'am for starting this channel. I am really very greatful to you. Please Keep Up the Good Work.
Greetings ma'am , I have been studying data structures through your videos only and I highly appreciate the efforts that you put in every single video of yours. Must watch for all those who have just started learning DS and are still having a hard time understanding the logic. Then this is it. Big Thanks!
Yeah I observed the same, for fixing it I decided to sync it from my own but when I downloaded the video from UA-cam (to be available in my editing software), I actually observed that there was some issue from UA-cam in this video as when watching this video offline the video and audio was synced actually.
I have Gone merge sort through 1. Code with harry ---FLOP 2.My Code School ----FLOP 3.Abdul Bari Sir------FLOP Ma'am you nailed.. I have studied 1st time from you. specially the tree part was strongly needed. you Earned a subscriber ToDay.
My secret of success with highly appreciated in such a way that i so far and beyond any other lecturers. simple and very simple way to explain to make understand between all the sorting ways. thankx
i never thought that these algorithms sound this simple. Its not these algorithms simple, its the way you presented it. You just nailed it. i wish i had a teacher like you. sooo fortunate that i came across your channel. while watching this lecture, at the beginning i thot like, i wudnt get this in my mind, but its just matter of 30 mins, and i'm super confident about my class tomorrow. thank you so-much for spreading knowledge for free.
Since discovering Jenny, anytime I am given any concept in my programming school, I run to find it in Jenny's Lectures, and like clockwork, she delivers superb content. You could tell from how she takes her time to explain a concept that she really wants you to get it. I am hooked!
No one has explained like u madam in UA-cam Thanks and very soon u will be in top tutor in UA-cam and please continue upload videos like competition coding mnc Company 🤩!
i used to face very much problem in doing dry run of recursive function, and some times it is very much difficult, and so far didnt found any teacher to explain the dry run of recursion so thoroughly, and i really appretiate it.
My professor spent the whole class rambling about merge sort and left me confused and with more questions. your explanation felt like cutting a butter with a hot knife, it went straight through my skull and forever etched in my memory. Thank you!
So Very Systematically Explained !! It simply clears even the iota of doubt one has . Only I would humbly request if you could kindly write down the step by step algorithm of the same as it is generally asked in exams along with the programming code . Also Kindly keep on posting more such videos . Once again kudos to you for making understand sorting technique so easily.
I had searched the whole internet/youtube/chatgpt but i didnt get the concept behind it , but after watching this video, all my doubts was clear . Thank you so much mam
Thank you mam, thank you for this amazing explanation. And i think, you are the, one of the rare, or may be only one, that's explain it on the board, and that's really cool. 🥰
You are really amazing ma'am! I mean the only reason I have been able to understand sorting is only because of you!!! Thank you so much! May god give you good health and prosperity 🙏
what the way of explaination mam....osm, i never cmnt ever but now my heart forced me to cmnt here bcz of many time i studied merge sort and there is some confusion remains, but with the help of your lecture all the confusions are cleared, thanks a lot mam, keep it up mam.
thanks a lot maam. i saw abdul bari sir's video but he didn't explain the merge process in the same video so I got confused but this is one of the best videos on mergesort since it explains the topic complete.
Thank you mam for the deep explanation,you are saving many students like me who can't afford to purchase the courses like this.Thank you very much for your effort and hardwork mam.You are great 👏
I am grateful for your clear and effective explanations. As a student pursuing a Bachelor's in Data Science at one of Pakistan's premier IT institutes, I found myself struggling to grasp the concept of merge sort in my current semester's DSA course. However, after discovering your guidance on the UA-cam channel led by Mam Jenny, everything became much clearer to me. Thank you for your invaluable assistance
Thank u mam...It's crystal clear as usual 👍🏻👍🏻 U truly deserve a huge gratitude from all of us on ur enormous efforts in order to provide us the quality education ☺️☺️
I attempted to understand MergeSort when I was student in 2002 but couldn't understand well. Now I am a teacher and I have to teach this in class. And with this video, I easily understood it. Thank you!
00:05 Merge sort is a sorting technique that works on the divide and conquer technique. 02:47 The text discusses dividing a list into sublists and the process of stopping when each sublist has only one element 08:36 Merge Sort Algorithm 11:41 Merge sort algorithm divides the array into smaller parts and then merges them 17:06 Merge sublists from 0 to 2. 19:19 Merge sorted sub lists to create a final sorted list 24:17 Comparing and sorting elements into sublists 26:51 Merge elements of a sub list into a sorted list 32:17 The given text is a set of instructions for sorting an array using the merge function. 35:05 Merge sort algorithm explained Crafted by Merlin AI.
One of the best teacher in UA-cam... Habituated to hear ma'am lecture rather than college lecture....my class teacher also refering this channel and teaching us😂😂lol
Thank you ma'am. I've had quiz of mine and you helped a lot. Thank you very much and keep making tutorials like this. And i loved your last expression ba bye 😁
Jenny Mam. Namaste. my heartful thanks for you. I have been taught by you through out this DSA playlist right from the beginning. From learning recursions easily to applying them in quick sort , merge sort, trees and graphs, you have taught me many things in clear, visual way. My respects to you mam. Thanks
Awesome video mam .. keep making such videos on c programming as they are helpful for us when we don't understand it in our colleges. Your explanation is also quite understandable as you explain each and every statement of the program and program logic is also meaningful. Please 🙏 don't stop making videos and carry on mam. Thank you.
Thanks a lot mam..Loved this video mam... All my doubts were throughly cleared after watching it.... Mam plzz upload a video on the time complexity of merge and quick sort also as soon as you can.... So that I can give my semester exam well
Instead of Mid = (lower_limit + higher_limit) /2, applying Mid= lower_limit + (higher_limit - lower_limit)/2 will save the code from throwing error such as integer overflow on higher values of N. Though the video and explaination is commendable. :)
@@millionaireminded4139 yeah sure my pleasure. Definition of Integer overflow : an integer overflow occurs when an arithmetic operation attempts to create a numeric value that is outside of the range that can be represented with a given number of digits - either higher than the maximum or lower than the minimum representable value (wikipedia) So lets assume for an integer variable x the maximum number it can hold be 15 and any number more than 15 allotted to x would lead to integer overflow. now if we take low = 1, high = 9 so mid = (low+high)/2 and in the worst case low would become 9. low = 9 and high = 9 now x = (low+high)/2 so 9+9 = 18 which is greater than 10 and will lead to integer overflow.( subsequently before 18 divides it by 2 it will throw error cuz 18>15) on the other hand x = low + (high-low)/2 x = 9+ (9-1)/2 x = 9+ (8/2) x = 9+ 4 x = 13 in each step of operation the value of x always remains under 15. This prevents integer overflow error. Hope this helps
Mam, I am big fan of your teaching style, I had watched lots of most watched video on youtube but didn't understand all the code and it was tough to tally or dry run, but after watching your videos, I understood the concepts as well as line by line code. Now I myself can write the code in ones and second try, I am grateful to you. please keep on making lots of tutorials.
thanku maam, you are the best teacher I have ever had, before I came across your videos, I was scared of this subject and all the coding part. Your videos give me confidence to pick up my laptop and write code. I am studying here in New York, and none of the profs are as good as you.
One of the wonderful teaching videos I have ever seen in youtube, I could see your passion about teaching. Thank you so much for sharing your knowledge with great explanation. Please keep sharing your knowledge!!
this is for those, who are having the audio sync issue, download the video and then play it, the audio sync issue is actually from the youtube.
The problem is still there even after we downloading it!!
@@abhishikth_777 may be he is saying download it using external websites as mp4 and you might have downloaded the video in youtube
@@suheelhilal1614 yess the problem is from youtube after downloading through external website the issue is cleared
the audio is delayed by 20 seconds , if you choose not download just put audio from mobile watch from laptop
it worked. Thank you!!!
I may sound stupid but I literally cried when she started explaining the mechanism behind the algo in detain. This shows how bad our universities and colleges are, and the amount of trauma, so carelessly they burden us with. Thanks a lot, ma'am. you are a true legend.
waste of time we just need the piece of paper when we go search a job. I learn more from proper people making videos 'UA-cam is a gold mine'
Jyada ho gaya bro
I know man. University makes me depressed 😭
@@gaunikasrivastava7851 bari naseeb vali ho app didi
Me too in the selection sort video like why nobody explain the tracing, my teacher just do it so quick and I can't get it at all even when I search in UA-cam nobody explains the tracing part and the applying part is so easy like people we know how to replace numbers explain the hard part !!!
i was literally shocked that how much efforts you're putting in one explanation and giving this precious content for freeeeeeee !! your lectures are so so so important for our understanding || thank youuuuu sooooooooo much || please never stop making videos !!
THIS WAS BY FAR THE BEST EXPLANATION I'VE HEARD MA'AM. TOOOOOOO GOOD. Understood the whole concept by just watching it once. Keep up the good work :)
A-men, much clearer than any others I've seen.
I agree i saw many videos however i struglled while implementing the code.This one cleared all my doubts 36 min video is better than a 6 min animation.
Ppppp
How she explains with a simple whiteboard with limited spaces are far superior than 6 min fancy animated videos that leave you with nothing after watching.
Rote raho
I used to have a physics teacher who I always told that he was born to teach because he explained concepts so well and made it impossible to not understand. You fall into that category Ma'am. English isn't even your first language and you explained the merge concept beautifully. I understood the pseudo code 100% too. AMAZING work. Thank you, your videos are the only reason I will complete my degree.
I understood this today. After 13 years of graduation. :) Thanks a ton.
Uncle?
Its rare to see teachers explain each step of a recursive example in such detail. You've explained it right from the beginning to the end taking into account each small step along the way. Amazing mam! People will start noticing your efforts and your channel will grow like anything. Much ❤️
Yeah👍
This is one of the best explanations of merge sort there on the internet. Nobody has had it so comprehensive and detailed like her. kudos!
Doubt from the starting of semester.
Now cleared in 30 min before exam ..
Just by your video.... 😅
Awesome Ma'am.... 👌🔥🔥
mam last line merge sort ki nae smjh araee haa original array mn copy wali 😓
@@shopeofediting4952 original array return karega merge function
great bro
@@shopeofediting4952 you dont have to copy the elements you can just print the array b[] but if you wanted to do it anyways then this is the code:
a[n] is the initial array of size n
and b[n] is the sorted array of size n
for(int i = 0;i
All of you just take a second to appreciate her patience🙏🏻. This is called true passion towards teaching. She is living in her Dharma.
Mam,you are going to become one of the top youtubers for CS and IT students
Keep going
Best of luck 🤗 from Akarshit Nigam
agreed 100%
Yes keep it up
Yap
Agreed...this was so hard sorting method for me....but now it is easy 😌
@@an_son_mathew_ yeh... Her lectures are far better than most of the other dsa lect. But still don't know why it's not recommended earlier
You're the only person I know who can break it down so beautifully. You are a genius!
Excellent explanation ma'am. I was so confused about the recursion tree. You literally explained the working so well. Thank you so much.
If someone facing issues with sound with any video in youtube, and then he/she downloads to watch that video, then imagine the quality of the video. Respect mam.
My fear of sorting algorithms is gone by these series of videos. Thanks for such a wonderful explanation.
Is there is an award for best teacher that goes to you ❤
Thanks for making algorithms understand so easily !! Appreciate your work!!
if someone searches for a video to understand what is really happen when u call the MergeSort function, I think this the best video for you, and nobody can explain it in detail like this
Thanks so much, your work is appreciated ❤
Your impeccable way of teaching is speechless. Thank You So Much Ma'am for starting this channel. I am really very greatful to you. Please Keep Up the Good Work.
Greetings ma'am , I have been studying data structures through your videos only and I highly appreciate the efforts that you put in every single video of yours. Must watch for all those who have just started learning DS and are still having a hard time understanding the logic. Then this is it. Big Thanks!
Why is this video out of sync with sound?😔
ikr!! literally its ruining everything
Yeah I observed the same, for fixing it I decided to sync it from my own but when I downloaded the video from UA-cam (to be available in my editing software), I actually observed that there was some issue from UA-cam in this video as when watching this video offline the video and audio was synced actually.
😭
Yes , first I think my ph is lagging
First download it then watch, it will be synced there
I have Gone merge sort through
1. Code with harry ---FLOP
2.My Code School ----FLOP
3.Abdul Bari Sir------FLOP
Ma'am you nailed..
I have studied 1st time from you.
specially the tree part was strongly needed.
you Earned a subscriber ToDay.
actually mycodeschool did not flop, it's the tragedy that happened with one of the co-founder/member. Harsha suryanarayana.
The best explanation I have ever seen, thank you so much mam , you deserves much more subscribers.Thank you very much for this wonderful explanation
I waited 35 minutes 26 seconds for that smile.............I knew u will give that smile.......TY.
My secret of success with highly appreciated in such a way that i so far and beyond any other lecturers. simple and very simple way to explain to make understand between all the sorting ways. thankx
You are super star taking my mind in the correct direction, and literally we are wasting our time and money in such colleges
The best teaching style.Easily I have understood merge sort from this video.This tutorial is better than others that I have seen.Thanks.
Your gratitude is humbly appreciated
i never thought that these algorithms sound this simple. Its not these algorithms simple, its the way you presented it. You just nailed it. i wish i had a teacher like you. sooo fortunate that i came across your channel. while watching this lecture, at the beginning i thot like, i wudnt get this in my mind, but its just matter of 30 mins, and i'm super confident about my class tomorrow. thank you so-much for spreading knowledge for free.
The best explanation I have seen for Merge Sort! I finally understood it. Thank you so much ma'am.
Since discovering Jenny, anytime I am given any concept in my programming school, I run to find it in Jenny's Lectures, and like clockwork, she delivers superb content. You could tell from how she takes her time to explain a concept that she really wants you to get it. I am hooked!
Unarguably the best example on the entire internet! Thank you!
Her explanation as calm as her and one thing thanks for such helpful video 👍👍👌👌
This video explains 'recursion' more than Merge sort itself. Its very useful in understanding 'working of multiple recursion' under the hood. Thanks
No one has explained like u madam in UA-cam Thanks and very soon u will be in top tutor in UA-cam and please continue upload videos like competition coding mnc Company 🤩!
i used to face very much problem in doing dry run of recursive function, and some times it is very much difficult, and so far didnt found any teacher to explain the dry run of recursion so thoroughly, and i really appretiate it.
My professor spent the whole class rambling about merge sort and left me confused and with more questions. your explanation felt like cutting a butter with a hot knife, it went straight through my skull and forever etched in my memory. Thank you!
So Very Systematically Explained !!
It simply clears even the iota of doubt one has . Only I would humbly request if you could kindly write down the step by step algorithm of the same as it is generally asked in exams along with the programming code .
Also Kindly keep on posting more such videos .
Once again kudos to you for making understand sorting technique so easily.
I had searched the whole internet/youtube/chatgpt but i didnt get the concept behind it , but after watching this video, all my doubts was clear . Thank you so much mam
I love you mam 😭😭... You cleared my deep doubt which i was having regarding the recursive part.
One of the best explanation of merge sort in UA-cam. Clear, crisp and simple 👌👌👌
Thank you mam, thank you for this amazing explanation. And i think, you are the, one of the rare, or may be only one, that's explain it on the board, and that's really cool. 🥰
You are really amazing ma'am!
I mean the only reason I have been able to understand sorting is only because of you!!! Thank you so much! May god give you good health and prosperity 🙏
what the way of explaination mam....osm, i never cmnt ever but now my heart forced me to cmnt here bcz of many time i studied merge sort and there is some confusion remains, but with the help of your lecture all the confusions are cleared, thanks a lot mam, keep it up mam.
Thanks maam. Explained this sorting method with so ease.
GOD BLESS YOU
You're literally the best teacher I have ever come across ❤️ please keep doing the hardwork..we need teachers like you🥺💓
Uso good sister
Ur instagram id tell me
thanks a lot maam. i saw abdul bari sir's video but he didn't explain the merge process in the same video so I got confused but this is one of the best videos on mergesort since it explains the topic complete.
making the tree for the call function(s) sequence was great thing ..... clear the concept of MergeSort.
For a reason it is one of the best DSA playlist on youtube.
Thank you mam for the deep explanation,you are saving many students like me who can't afford to purchase the courses like this.Thank you very much for your effort and hardwork mam.You are great 👏
Thank you for this exceptional explanation of the Merge Sort algorithm, breaking down complex concepts into easy-to-understand steps.
Thank You Very Much Mam , You taught the concept of Merge sort as well as how recursive calls tae place in divide & conquer VERY WELL.😊
hii
One of the best lectures on Mergesort. I am from Bangladesh and really love the way you explained this complicated topic with ease !
Awesome ma'am.
from 3 days i was struggling looked a lot of video which skipped this part mergeSort()(
That is best explained video on coding I have ever seen till now thank you ma'am
Ma'am you really rock
You explained it so well 👍
Your concept was really good
I liked the way
Speechless
Mam I just want to tell, you killed it you literally made me to feel like yes boss now I will do it... Big respect from bottom of my heart...
You are my favorite cs teacher
I am grateful for the kind words and encouragement
Best explanation of merge sort I ever heard in my life ...keep up the work ...world needs teachers like you
Mam one of the best lecture in merge sort example
I am grateful for your clear and effective explanations. As a student pursuing a Bachelor's in Data Science at one of Pakistan's premier IT institutes, I found myself struggling to grasp the concept of merge sort in my current semester's DSA course. However, after discovering your guidance on the UA-cam channel led by Mam Jenny, everything became much clearer to me. Thank you for your invaluable assistance
Stupendous work. Loved it to bits!
First time I was able to figure out merge sort after watching this video. Thanks a ton!
Been to two different schools here in the states and so far your explanation is superb compare to some instructors. Thank you for all your hard work!
Such a simple explaination , professors literally make it really complex
Ma'am your way of explaining is so unique and makes even complex techniques so easy for us.
Thankyou so much
please Any One Give Me The Code Please I M Facing Problem In Marge() function
Very nice madam
Best explanation ever... ❤
Thank u mam...It's crystal clear as usual 👍🏻👍🏻 U truly deserve a huge gratitude from all of us on ur enormous efforts in order to provide us the quality education ☺️☺️
I attempted to understand MergeSort when I was student in 2002 but couldn't understand well. Now I am a teacher and I have to teach this in class. And with this video, I easily understood it. Thank you!
00:05 Merge sort is a sorting technique that works on the divide and conquer technique.
02:47 The text discusses dividing a list into sublists and the process of stopping when each sublist has only one element
08:36 Merge Sort Algorithm
11:41 Merge sort algorithm divides the array into smaller parts and then merges them
17:06 Merge sublists from 0 to 2.
19:19 Merge sorted sub lists to create a final sorted list
24:17 Comparing and sorting elements into sublists
26:51 Merge elements of a sub list into a sorted list
32:17 The given text is a set of instructions for sorting an array using the merge function.
35:05 Merge sort algorithm explained
Crafted by Merlin AI.
You have solved all my doubts, love you Ma'am from the core my heart.
You are really a great mentor, you explained these concepts so well, thank you for all the efforts you are putting for all of us.
I watched quick sort from many channels, but finally understood from you. Thanku maam :)
One of the best teacher in UA-cam... Habituated to hear ma'am lecture rather than college lecture....my class teacher also refering this channel and teaching us😂😂lol
Very Nyx. What an explanation.I cannot stop myself from appreciating.
I was struggling with the merging part in code... Ur video has cleared my doubts.. thanks for the great teaching madam...
She has explained Recursion so beautiful. Each and every step where the control goes..great work
Every time class goes on in college ,I don't care because Jenny ma'am with us to explain the thing in deep 😁❤️
I saw lots of videos in this topic, but this one is the best explanation ever!
Thank you ma'am. I've had quiz of mine and you helped a lot. Thank you very much and keep making tutorials like this. And i loved your last expression ba bye 😁
Jenny Mam. Namaste. my heartful thanks for you. I have been taught by you through out this DSA playlist right from the beginning. From learning recursions easily to applying them in quick sort , merge sort, trees and graphs, you have taught me many things in clear, visual way. My respects to you mam. Thanks
Awesome video mam .. keep making such videos on c programming as they are helpful for us when we don't understand it in our colleges. Your explanation is also quite understandable as you explain each and every statement of the program and program logic is also meaningful. Please 🙏 don't stop making videos and carry on mam. Thank you.
lots of gratitude ma'am
your explanation is very simple and systematically.
Thanks a lot mam..Loved this video mam... All my doubts were throughly cleared after watching it.... Mam plzz upload a video on the time complexity of merge and quick sort also as soon as you can.... So that I can give my semester exam well
Wonderful explanation .
I tried to learn this algorithm from many channels but this is the best explanation.
Instead of Mid = (lower_limit + higher_limit) /2,
applying Mid= lower_limit + (higher_limit - lower_limit)/2 will save the code from throwing error such as integer overflow on higher values of N. Though the video and explaination is commendable. :)
can u plz explain how it will save from throwing such kind of errors??
@@millionaireminded4139 yeah sure my pleasure.
Definition of Integer overflow : an integer overflow occurs when an arithmetic operation attempts to create a numeric value that is outside of the range that can be represented with a given number of digits - either higher than the maximum or lower than the minimum representable value (wikipedia)
So lets assume for an integer variable x the maximum number it can hold be 15 and any number more than 15 allotted to x would lead to integer overflow. now if we take low = 1, high = 9 so mid = (low+high)/2
and in the worst case low would become 9. low = 9 and high = 9 now
x = (low+high)/2
so 9+9 = 18 which is greater than 10 and will lead to integer overflow.( subsequently before 18 divides it by 2 it will throw error cuz 18>15)
on the other hand
x = low + (high-low)/2
x = 9+ (9-1)/2
x = 9+ (8/2)
x = 9+ 4
x = 13
in each step of operation the value of x always remains under 15.
This prevents integer overflow error.
Hope this helps
@@chetansahu1505 thank you soo much
@@millionaireminded4139 can you please let us know to which size array B should be initialised ?
@@telaproluviswanadha3294 same I am stucked with the same issue
Mam, I am big fan of your teaching style, I had watched lots of most watched video on youtube but didn't understand all the code and it was tough to tally or dry run, but after watching your videos, I understood the concepts as well as line by line code. Now I myself can write the code in ones and second try, I am grateful to you. please keep on making lots of tutorials.
One of the best lectures in youtube. God bless you mam. 🙏😇
I am a software engineer ,revisiting concepts.Your video is very useful,Thank you
Awwyeaa!! Thnkyuu so much for this explanation..really great
The explanation is very good and clear . Each line is understandable what u taught.
Hatss off🔥💥..to ur teaching. Mam..please put videos on linked list in c ++...it s a humble request😥🙏🙏🙏
thanku maam, you are the best teacher I have ever had, before I came across your videos, I was scared of this subject and all the coding part. Your videos give me confidence to pick up my laptop and write code. I am studying here in New York, and none of the profs are as good as you.
🛑🛑🛑🛑🛑🛑🛑🛑🛑🛑Audio is miss matched 🛑🛑🛑🛑🛑🛑🛑🛑🛑
Your hardwork is appreciable madam
little correction : you should have initialized b array with size ub+1 -> int b[ub+1]; inside merge function.
Mam, i am from Africa you are best teacher for all Africans Cs students ,this is my opinion Thank You
That recursion's pictorial discription is like preorder traversal
One of the wonderful teaching videos I have ever seen in youtube, I could see your passion about teaching. Thank you so much for sharing your knowledge with great explanation. Please keep sharing your knowledge!!
Just Download this video and It will sync with audio PROBLEM SOLVED :)
Literally don't hv words...
How beautifully you explained this complex mechanism..
Smooth like butter...
Respect and lots of love mam😇😇