Merge Sort
Download as PPTX, PDF0 likes269 views
Merge sort is a sorting algorithm that uses a divide and conquer approach to sort arrays and linked lists. It divides the list into halves, recursively sorts each sublist, and then merges the sorted sublists into a single sorted list. With a time complexity of O(n log n), merge sort is one of the most efficient sorting algorithms as it keeps dividing lists into smaller sorted runs that are then merged back together.
1 of 3
Download to read offline
More Related Content
Viewers also liked (20)
Ad
Similar to Merge Sort (20)
Ad
Recently uploaded (20)
Merge Sort
- 1. Merge Sort Merge sort is a sorting technique based on divide and conquer technique. With worst-case time complexity being Ο(n log n), it is one of the most respected algorithms. Merge sort first divides the array into equal halves and then combines them in a sorted manner. Mergesort is a algorithm that was invented by John von Neumann in 1945
- 2. Algorithm Merge sort keeps on dividing the list into equal halves until it can no more be divided. By definition, if it is only one element in the list, it is sorted. Then merge sort combines smaller sorted lists keeping the new list sorted too. Step 1 − if it is only one element in the list it is already sorted, return. Step 2 − divide the list recursively into two halves until it can no more be divided. Step 3 − merge the smaller lists into new list in sorted order.
- 3. UML Scheme