I have been trying to understand the algorithmic approach of merge sort but have failed to do so. I have understood how it actually works, its just the argorithmic approach. What should I do or rather can someone help me out?
see abdul bari or geeks for geeks video on youtube…bro …esi chize nhi puchte .ek suggestion hai pehle google kro bhai…
If you have understood how the method works, the code is doing exact same thing. Which part of the code you are exactly having difficulty in?
I think discussion forum is for discussing doubts related with data structures or algorithms. Compared to most of the posts which just have discussion about totally off topic things, this might be a good question.
Don’t say like this “esi chize nai puchte”,
He has rights to ask any doubt, and our responsibility is to help other if we are capable of
Hey I am ready to help you out.
can you tell me that which part you are having doubt, dividing part or merge part ?
bro me mana nhi kar rha batane se par pehle ek baar krna chahiye video dekho bcz uski video pasand h, bura mat manna but actually sab ye hi krte h kuch bhi hoga seedha codechef pe utha ke daal denge ,it’s my point of view baki aapko jesa lage…
I agree with you that giving suggestions to someone is good.
but I just saying directly say no to someone, it is not good : )
yaa… i also agree on that muje bhi koi seedha mana karega to bura lagega par mera seedha matlab ye nhi tha ,chalo koi nhi ,leave this…
First make sure you have some knowledge about recursion.
Then this might help.
watch mycodeschool youtube
Bhai, pichle eek hafte se google hi kar raha hun XD. Dimag kharab ho gaya mera.
chalo batao kya nhi aaya…i will explain u,