Merge sort

Merge Sort 1 – The Algorithm

This is the first in a series of videos about the merge sort. It describes the principle of the merge sort algorithm, which takes a ‘divide and conquer’ approach to the problem of sorting and unordered list. The videos that follow build on these principles, leading towards a recursive im

From playlist Sorting Algorithms

Merge Sort 2 – Towards an Implementation (Split a List)

This is the second in a series of videos about the merge sort. It includes a description of an algorithm and pseudocode for taking an unordered list and splitting it into two separate unordered lists. The videos that follow build on these principles, leading towards a recursive implement

From playlist Sorting Algorithms

Merge Sort 3 – Towards an Implementation (Merge Two Lists)

This is the third in a series of videos about the merge sort. It includes a description of an algorithm and pseudocode for merging together two ordered lists into a single ordered list. The videos that follow build on these principles, leading towards a recursive implementation of a merg

From playlist Sorting Algorithms

Merge Sort 4 – Towards an Implementation (Recursive Function)

This is the fourth in a series of videos about the merge sort. It includes a description of some pseudocode which combines into a single recursive function a helper program for splitting a list, and a helper program for merging a pair of ordered lists. This video describes how successive

From playlist Sorting Algorithms

Merge Sort Algorithm | Merge Sort Explained | Sorting Algorithms In Data Structures | Simplilearn

This video is based on the Merge Sort Algorithm. This tutorial on Merge Sort Algorithm Explained the fundamental steps and Procedures to be followed to design, develop, implement the Merge Sort Algorithm. Merge Sort Algorithm is one of the important Sorting Algorithm in Data Structures. Th

From playlist Data Structures & Algorithms [2022 Updated]

Merge Sort

From playlist Week 4 2015 Shorts

Searching and Sorting Algorithms (part 3 of 4)

Introductory coverage of basic searching and sorting algorithms, as well as a rudimentary overview of Big-O algorithm analysis. Part of a larger series teaching programming at http://codeschool.org

From playlist Searching and Sorting Algorithms

1 7 Merge Sort Analysis 9 min

From playlist Algorithms 1

1 5 Merge Sort Motivation and Example 9 min

From playlist Algorithms 1

Lecture 15 | Programming Abstractions (Stanford)

Lecture 15 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department. Julie continues to cover sorting. She begins with an example of a selection sorting code and a graphic demo of the code in progress. Thereafter, she explains the d

From playlist Lecture Collection | Programming Abstractions

Lecture 8 - Mergesort / Quicksort

This is Lecture 8 of the CSE373 (Analysis of Algorithms) course taught by Professor Steven Skiena [http://www3.cs.stonybrook.edu/~skiena/] at Stony Brook University in 2016. The lecture slides are available at: https://www.cs.stonybrook.edu/~skiena/373/newlectures/lecture8.pdf More infor

From playlist CSE373 - Analysis of Algorithms 2016 SBU

Section 3: More Comfortable

From playlist CS50 Sections 2012

CSE 373 -- Lecture 8, Fall 2020

From playlist CSE 373 -- Fall 2020

CS50 2015 - Week 3, continued

From playlist CS50 Lectures 2015

Heap Sort - Intro to Algorithms

This video is part of an online course, Intro to Algorithms. Check out the course here: https://www.udacity.com/course/cs215.

From playlist Introduction to Algorithms