Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

External sorting

Related lectures (25)

Merge Sort: Sorting Algorithm

Explains the merge sort algorithm, its correctness, and time complexity compared to other sorting algorithms.

Merge Sort: Divide and Conquer

Explores the Merge Sort algorithm, applying the Divide and Conquer approach to sorting arrays efficiently.

Aggregation queries and sorting MOOC: Geographical Information Systems 1

Covers aggregation queries and sorting of results in Geographic Information Systems.

Divide-and-Conquer: Merge Sort

Explores loop invariants, time analysis, and the Divide-and-Conquer approach with a focus on Merge Sort.

Parallel Sorting: Merge Sort Algorithm

Covers the implementation of a parallel merge sort algorithm in Scala, comparing its performance with quicksort.

Solving Recurrences

Focuses on solving recurrences in divide-and-conquer algorithms using various techniques and examples.

Introduction to Algorithms: Course Overview and Basics

Introduces the CS-250 Algorithms course, covering its structure, objectives, and key topics in algorithmic problem-solving.

Polymorphism and Proofs

Covers parametric polymorphism, lists construction, tuples, generic methods, merge sort, and proving program properties.

Recursive Sorting: Merge Sort

Explains recursive sorting using Merge Sort and its linearithmic complexity.

Sorting Algorithms: Sorting Methods and Comparison

Explores sorting methods, insertion sort, and algorithm comparison for efficient data organization.

Lambda Functions in Java

Covers lambda functions in Java, focusing on sorting algorithms implementation.

Recursive Sorting: Merge Sort

Covers the concept of Merge Sort, a highly efficient recursive sorting algorithm.

Exploring Car Data Analysis

Explores car data analysis using Python programming for tasks like file handling, dictionary creation, and attribute analysis.

Recursive Sorting: Merge Sort

Covers the concept of Merge Sort, a recursive sorting algorithm that divides a list into sublists until each sublist has one element.

Tuples and Generic Methods

Covers the implementation of merge sort in Scala and the parameterization of sort functions.

Sorting Algorithms: Merge Sort MOOC: Information, Computation, Communication: Introduction to computational thinking

Presents the merge sort algorithm for sorting integers and the concept of fusion for merging ordered lists efficiently.

Hashing and Sorting Log in to Mediaspace to watch this video

Covers hashing, sorting, extendible hashing, linear hashing, and external sorting.

Hashing & Sorting Log in to Mediaspace to watch this video

Explores hashing techniques like static, extendible, and linear hashing, along with sorting methods such as external merge sort and B+ trees.

Merge Sort: Divide-and-Conquer Log in to Mediaspace to watch this video

Introduces Merge Sort, a divide-and-conquer algorithm for efficient array sorting, discussing correctness, runtime analysis, linear-time merging, and recurrence solving techniques.

Quick Sort: Divide-and-Conquer Log in to Mediaspace to watch this video

Explores the Quick Sort algorithm, focusing on its divide-and-conquer approach and time complexity analysis.