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

Concept

Merge algorithm

Related lectures (26)

Merge Sort: Sorting Algorithm

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

Divide-and-Conquer: Merge Sort

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

Merge Sort: Divide and Conquer

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

Solving Recurrences

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

Polymorphism and Proofs

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

Modes of Convergence of Random Variables

Covers the modes of convergence of random variables and the Central Limit Theorem, discussing implications and approximations.

Optimal Tests for Simple Hypotheses

Discusses optimal tests for simple hypotheses and the significance of standardized distance in hypothesis testing.

Confidence Intervals and Hypothesis Tests

Covers confidence intervals, hypothesis tests, standard errors, statistical models, likelihood, Bayesian inference, ROC curve, Pearson statistic, goodness of fit tests, and power of tests.

Transformations of Joint Densities

Covers the transformations of joint continuous densities and their implications on probability distributions.

Recursive Sorting: Merge Sort

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

Recursive Sorting: Merge Sort

Explains recursive sorting using Merge Sort and its linearithmic complexity.

Fast Data Formats

Compares fast data formats and provides tips for efficient data processing.

Parallel Sorting: Merge Sort Algorithm

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

Tuples and Generic Methods

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

Generating Functions: Properties and Applications

Explores generating functions, Laplace transform, and their role in probability distributions.

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.

Induction and Recursion: Summary

Covers mathematical induction, recursively defined functions, and iterative algorithms for problem-solving.

Statistical Hypothesis Testing

Covers statistical hypothesis testing, likelihood estimation, and confidence intervals construction.

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.

Recursion and Karatsuba Multiplication

Explains recursion in algorithms and the Karatsuba multiplication method for large numbers.

Related lectures (26)

Merge Sort: Sorting Algorithm

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

Divide-and-Conquer: Merge Sort

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

Merge Sort: Divide and Conquer

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

Solving Recurrences

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

Polymorphism and Proofs

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

Modes of Convergence of Random Variables

Covers the modes of convergence of random variables and the Central Limit Theorem, discussing implications and approximations.

Optimal Tests for Simple Hypotheses

Discusses optimal tests for simple hypotheses and the significance of standardized distance in hypothesis testing.

Confidence Intervals and Hypothesis Tests

Covers confidence intervals, hypothesis tests, standard errors, statistical models, likelihood, Bayesian inference, ROC curve, Pearson statistic, goodness of fit tests, and power of tests.

Transformations of Joint Densities

Covers the transformations of joint continuous densities and their implications on probability distributions.

Recursive Sorting: Merge Sort

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

Recursive Sorting: Merge Sort

Explains recursive sorting using Merge Sort and its linearithmic complexity.

Fast Data Formats

Compares fast data formats and provides tips for efficient data processing.

Parallel Sorting: Merge Sort Algorithm

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

Tuples and Generic Methods

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

Generating Functions: Properties and Applications

Explores generating functions, Laplace transform, and their role in probability distributions.

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.

Induction and Recursion: Summary

Covers mathematical induction, recursively defined functions, and iterative algorithms for problem-solving.

Statistical Hypothesis Testing

Covers statistical hypothesis testing, likelihood estimation, and confidence intervals construction.

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.

Recursion and Karatsuba Multiplication

Explains recursion in algorithms and the Karatsuba multiplication method for large numbers.