its like a light just beamed down on my had wow so impressive thanks for this awesome vide you absolutely rock for this thanks for explaining what happens at each interval thanks thanks thanks thanks thanks thanks thanks thanks thanks
the else statement covers the condition in which the two elements are equal to one another. for example, 0,1,2,3 and 0,4,5,6. it will hit the else statement, see that 0 is not less than 0 (first if statement), then hit the else statement adding the element in array 2 to the resultant array. Sorry if this is a bad explanation.
Am I correct to assume that you need another if, else in the even that two of the indices in arr1 and arr2 carry the same integer. If so can anyone elaborate where and how that should be implemented? Do you just change the third line to: if(arr[i]
How Merge sort sorts the following sequence of keys in ascending order 12,22,33,44 48,56,57,65,76,84 with neat diagram representing sequence of recursion calls. Explain its time complexity
I think the last two lines have mistake There shouldn't be i++ k++ in braces but out of them It shoulď be res [k] like that not k++ Before while loop got terminated k already got incremented and when entering last while loop at end k got incremented again leaving a blank slot
I had been trying to solve this problem all day long, thank you so much for the explanation!
same here ;-;
Same 😀
sam
Very clear explanation sir..
The way you explain the concept makes me understand the logic of the program in the clear manner...
Thanks a lot
Thank u so much bcoz of u I finally understood coding for merger sort..
Your explanation is sooooo good. I tried to solve this problem for the entire day and then I saw this vid.
Very clearly explained.. I was looking for this kind of. No constraint that both array of same size. Thank you so much
Very cleanly explained sir
Thank you very much
best ever explanation!!!😍 crystal clear concept.. Thankyou very much sir!!
very very very thanku sir
u r great
u passed successfully explaining this complicated topic in too too simple manner......thanku so much
thank you sir for such a good explanation. I'm finally able to understand all these questions.
Tomorrow is my exam and I faced a lot of problem in this program but after watching this video everything is clear .
🙄🙄🙄
Thanks for uploading it.. You are doing a great job.. Please upload more videos of competitive programming.. We really need it
Thanks I was stuck from last three hour and you made me solve this in just few minutes thanks
This is an amazing walkthrough of the process 😀 Thank you!
Thoroughly explained as always. Thank you!
nice explanation.Plz do continue posting videos...
It is a Great job, which you are doing!.. Keep Sharing
Nice work... nicely explained..thanks sir
its like a light just beamed down on my had wow so impressive thanks for this awesome vide you absolutely rock for this thanks for explaining what happens at each interval thanks thanks thanks thanks thanks thanks thanks thanks thanks
same here..
this video like ayurvedic medicine for me, amazing sir. thanks for this video
Good explaination sir,helped a lot thankyou
Thanks you from Senegal ❤❤❤ God bless you
I think you will have to add a condition for both elements being equal. In that case copy the value and increment i, j and k.
no that condition is not required
because condition evaluates to true or false in this case it will evaluate to false which is correct logicaly
your explanation way is very fantastic thank you sir
Thanks so much for many time iam tried to under this but i can't
But this vedio is very help full for me 😘❤
Some of my friends asked who is this guy talking like this, i said he is the one who helped me under stand how to solve the problem you didnt. :/
Best explanation sir 🔥😀..Thanks a lot sir for these solutions ❤️
Great explaination sir you are making me understand DSA very well thankyou need new updates
I love you and thank you bro 🤧🤧
Finally i understand so clearly
Very easy explanation ! thank you 😍🤩
Mast samjae re baba ...dimag chamk gya 😘😘😘❤❤
Great explanation🙌
very well explained boss. thanks
This was such a good explanation!
Very very osam explanation. God bless you
You can achieve same using || condition in while loop and check first if condition as i
Sir Your explanation is awesome.please do more videos on interview based questions.
Such a great explanation!
Thank you.!
Would you like to donate your hair...we cud pay you in cash
Superb explanation
clear and best explanation
good implementation of 2 pointer approach
Nice explaintion sir..thanku so much.
Good expalnation sir. Ii is Easily understood ..👍
well explained it was very helpful thank you
Excellent video sir
superior explaination!!!!!!!!! great work dude :-)
sir thanks alot from qasim lahore pakistan
Super.....sir add more videos this type
Excellent explanation, please also explain how to merge n sorted array into an array
Excelent explanation👍👍👍
nice one sir, keep it up 👍👍
sir....you are the best
you explains very well 😍😍
awesome tutorial sir
Thank you for this, was too helpful!
nice explanation sir
I owe you, you saved my life
Great Explanation sir!!
This indian man is the best!
Thanks a lot sir 😊✨🙏
sir,i have this doubt what should we do if we encountered the situation where where we have two same numbers ...?.
thanks alot bro ,it is really helped me..
this is really good...thank you sir
excellent explaination
excellent explanation! thanks!! I've subscribed :)
You help me a lotttt!!! thank you very much
Sir can u please do a video on algorithm for merging 2 arrays into a third array in descending order.
Thank u sir nice explanation
sir what will happen if two elements are equal in arrays
the else statement covers the condition in which the two elements are equal to one another. for example, 0,1,2,3 and 0,4,5,6. it will hit the else statement, see that 0 is not less than 0 (first if statement), then hit the else statement adding the element in array 2 to the resultant array. Sorry if this is a bad explanation.
If there r duplicates then only one element will be copied
Its wrong algorithm
nicely done sir
Took me 5 minutes to realise if he is speaking English
P.S: no hate comments just saying
Its clear now, thanks sir 👍🏼
you are amazing sir
Sir aap haste boht accha hoo 🤣🤣🤣😅
Nicely explained
Will it work if arrays have same elements?
Great video!!!
nice explanation.
simple and nice explaination
Am I correct to assume that you need another if, else in the even that two of the indices in arr1 and arr2 carry the same integer. If so can anyone elaborate where and how that should be implemented? Do you just change the third line to: if(arr[i]
Merge procedure of merge sort
Thank for ur explanation
your knowledge is appreciated but if your accent was more understandable it would be perfect. anyway, thanks for this tutorial vid
What will be the result when array 1 and array 2 any element become same?
awesome! nice explained
if one array is sorted in ascending order and other is sorted in descending order how we can merge them
How Merge sort sorts the following sequence of keys in ascending order 12,22,33,44 48,56,57,65,76,84 with neat diagram representing sequence of recursion calls. Explain its time complexity
why we are not checking for equals to if s1==s2
Great explanation!
i followed this example in java in it only sorted the elements up until 9 this was a good start but it doesn't work
does it handle duplicates in two input??
It wont remove duplicates.
ruclips.net/video/gf7vdIin0dk/видео.html see this vdeo to remove duplicates... apply this after the merge sort🤗
Hi, sir what if the second array of last four elements are not sorted then, the resultant array will not be sorted.?
You have to intialised both the arrays as sorted
Please tell the algorithm of printing the series of prime numbers from 2 to the number asked by the user
tnxx. it was really helpfull.
Please write the piece of code for printing that merged array.
I think the last two lines have mistake
There shouldn't be i++ k++ in braces but out of them
It shoulď be res [k] like that not k++
Before while loop got terminated k already got incremented and when entering last while loop at end k got incremented again leaving a blank slot
very well explained.
how can we merge these two arrays using the for loop?
How can we decide whether the remaining elements in the left over are sorted??
How can we just copy paste
Shaik, we are not sorting here.. if both the arrays are sorted, then only this solution will work. for unsorted arrays we can not use this technique
How to merge multiple sorted array into one sorted array, could you please give an example
Meri taraf se aapko ek gheeli chummi 😂🙏💯
XD bhai.. video bna na bnd kr denge wo esa mat kro XD