Login to filter by course Login to filter by course Reset
Introduces Merge Sort, a divide-and-conquer algorithm for efficient array sorting, discussing correctness, runtime analysis, linear-time merging, and recurrence solving techniques.
Focuses on solving recurrences in divide-and-conquer algorithms using various techniques and examples.
Covers parametric polymorphism, lists construction, tuples, generic methods, merge sort, and proving program properties.
Covers hashing, sorting, extendible hashing, linear hashing, and external sorting.
Covers confidence intervals, hypothesis tests, standard errors, statistical models, likelihood, Bayesian inference, ROC curve, Pearson statistic, goodness of fit tests, and power of tests.
Compares fast data formats and provides tips for efficient data processing.
Covers the concept of Merge Sort, a recursive sorting algorithm that divides a list into sublists until each sublist has one element.
