Summary of CS 3345- Ch 7- Part2

00:00:00 - 00:25:00

This YouTube video explains how to calculate the running time for a merge sort. The running time for an element is equal to the running time for the element plus the logarithm of the number of elements. The video also discusses the running time for the algorithm, which is linear in the number of elements.

• 00:00:00 In this lecture, the merge sort algorithm is discussed. The algorithm starts by comparing two elements in an input array, and if the element is smaller, it is placed in the output array at the position of the smaller element. The algorithm is then repeated until one of the arrays is exhausted.
• 00:05:00 This video explains how to merge two sorted lists using the merge sort algorithm. First, the two sorted lists are divided into two halves, and then each half is sorted using the merge sort algorithm. Finally, the two sorted lists are merged, and the sorted list is returned.
• 00:10:00 This video demonstrates how to merge two sorted lists using the merge sort algorithm. The code for the merge sort function is shown along with two recursive calls. The original list is divided into two halves, and each half is sorted using the merge sort algorithm.
• 00:15:00 In this video, the author discusses the Merge Sort algorithm. The algorithm is based on the left-to-right sorting of arrays of equal size. The left half of the arrays is sorted first, then the right half is sorted. The merge sort algorithm is implemented in a recursive manner, and the running time is proportional to the number of recursive calls.
• 00:20:00 This video discusses the running time for a merge sort algorithm, which is linear in the number of elements.
• 00:25:00 This YouTube video explains how to calculate the running time for a merge sort. The running time for an element is equal to the running time for the element plus the logarithm of the number of elements.