Merge Sort - SAP ABAP || Algorithms and DataStructures
Merge Sort Array: Divide and conquer approach is used in the merge sort array. By finding the midpoint of the array or the input we separate the array/input into two separate sub arrays. Taking the left sub array we call the same sub routine recursively , Take the right sub array we do the same, call the sub routine recursively. Finally at the end, Merge both the left and right sub arrays in to the final array by comparing both left and right sub arrays. Merge sort takes O(nlogn) time complexity, which is usually best kind of algorithm or one of the best kinds of algoirthm apart from the quick sort . To keep the length of the video short, i have written the code and explained it in the interest of your time. I hope you liked it, do let me know for any improvisations or any other brilliant ways of coding the same algorithm. Always welcome :)
Merge Sort Array: Divide and conquer approach is used in the merge sort array. By finding the midpoint of the array or the input we separate the array/input into two separate sub arrays. Taking the left sub array we call the same sub routine recursively , Take the right sub array we do the same, call the sub routine recursively. Finally at the end, Merge both the left and right sub arrays in to the final array by comparing both left and right sub arrays. Merge sort takes O(nlogn) time complexity, which is usually best kind of algorithm or one of the best kinds of algoirthm apart from the quick sort . To keep the length of the video short, i have written the code and explained it in the interest of your time. I hope you liked it, do let me know for any improvisations or any other brilliant ways of coding the same algorithm. Always welcome :)