Join Joe Marini for an in-depth discussion in this video The merge sort, part of Programming Foundations: Algorithms.
- [Instructor] Now let's take look at how…the merge sort works.…The merge sort is known as a divide-and-conquer algorithm.…It takes a given set of data and then breaks it down…into smaller parts that are easier to work with.…It uses recursion to break the data down…and then sort the smaller sets of data,…gradually working it's way back up to the original dataset.…The merge sort has a very good performance profile.…It typically operates on it's dataset in logarithmic time,…giving it a big O of n log n.…
So, that's log linear if you're remembering from…our earlier table.…So, to understand how the merge sort works,…the key is how to merge two sorted arrays together.…So let's imagine that we had two arrays that are already…sorted and we're going to merge them into one.…So, to merge these two while keeping the result sorted,…we start with the first elements from the two arrays.…In this case, the four is smaller than the 12,…so we insert the four, and then we advance the index…of the array that we just inserted from to the next element,…
Author
Released
11/8/2018- Measuring algorithm performance
- Working with data structures such as arrays, stacks, and queues
- Looping and recursion
- Sorting data
- Searching data
- Filtering and value counting with hash tables
Skill Level Beginner
Duration
Views
-
Introduction
-
What you should know1m 35s
-
1. Overview
-
What are algorithms?2m 44s
-
-
2. Common Data Structures
-
Arrays2m 29s
-
Linked lists2m 36s
-
Linked lists walkthrough7m 35s
-
Stacks and queues2m 43s
-
Hash tables7m 59s
-
3. Recursion
-
Understanding recursion3m 38s
-
Simple recursion example3m 9s
-
Power and factorial4m 14s
-
-
4. Sorting Data
-
Overview of sorting2m 4s
-
The bubble sort5m 8s
-
The merge sort2m 24s
-
Implement the merge sort5m 10s
-
The quicksort3m 31s
-
Implement the quicksort5m 39s
-
-
5. Searching Data
-
Unordered list search3m 45s
-
Ordered list search5m 30s
-
-
6. Other Algorithms
-
Find max value recursively3m 44s
-
Conclusion
-
Next steps1m 18s
-
- Mark as unwatched
- Mark all as unwatched
Are you sure you want to mark all the videos in this course as unwatched?
This will not affect your course history, your reports, or your certificates of completion for this course.
CancelTake notes with your new membership!
Type in the entry box, then click Enter to save your note.
1:30Press on any video thumbnail to jump immediately to the timecode shown.
Notes are saved with you account but can also be exported as plain text, MS Word, PDF, Google Doc, or Evernote.
Share this video
Embed this video
Video: The merge sort