In this video I have explained Merge sort algorithm concept along with code in Tamil. Merge sort is divide and conquer technique It divides input array in two halves, calls itself for the two halves and then merges the two sorted halves. Time complexity of the algorithm will be O(n log n) in average case. Merge sort Tamil explanation make everyone understand the concepts easily.
Quick Sort in Tamil : • Quick Sort in Tamil | ...
Must know Programming Interview question: • Programming Interview ...
15 сен 2024