Merge sort
Download as PPTX, PDF0 likes264 views
This document discusses the merge sort algorithm, which uses a divide and conquer strategy to sort a list of items. It breaks the list into individual items, recursively sorts each sublist, and then merges the sublists back together in a sorted order. The algorithm has a worst-case running time of O(n log n) for a list of length n, making it an efficient sorting algorithm.
1 of 14
Download to read offline
Merge sort
- 2. Merge Sort
- 3. Merge Sort
- 4. Merge Sort
- 5. Merge Sort
- 6. Merge Sort
- 7. Merge Sort
- 8. Divide and Conquer Strategy
- 9. Merge Sort
- 10. Merge Sort
- 11. Merge Sort
- 12. Limit Rule
- 13. Merge Sort