MERGE SORT USING DIVIDE AND CONQUER WITH EXAMPLE AND TIME COMPLEXITY || DAA

[@SivakumariThota-y9n]

very good explaining sir and it is very understanble by us

[@dikshitaprakash]

thank you so much sir... i was searching time complexity of merge sort but haven't found in any videos but got in yours and you explained it so well also🙂🤝🏻

[@krishnar924]

What a explanation 😮

[@pratikv24]

sir can you explain this without the b variable ,its confusing when the b variable came suddenly in the algorithm

[@NehaSharma_nsds]

B is the new array where all sorted elements will be stored and k is the index of b variable just like i is the index of unsorted array variable a.

[@SanthoshSanthosh-mq8oy]

Where is program sir u explained algorithm

[@shahsikalagowda183]

Sir it will be great with implementation 😢