Lectures related to Tuples and Generic Methods

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

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.

Recursive Sorting: Merge Sort

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

Sorting Algorithms: Selection and Insertion

Introduces selection and insertion sorting algorithms, explaining their correctness and time complexity.

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.

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.

Introduction to Algorithms: Course Overview and Basics

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

Sorting Algorithms: Sorting Methods and Comparison

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

Merge Sort: Divide and Conquer

Covers the merge sort algorithm, which recursively divides, sorts, and merges sublists to achieve a final sorted list.

Efficient Algorithms for Sorting and Merging

Explores efficient sorting algorithms and the importance of reducing comparisons for optimal performance.

Recursive Sorting Algorithms

Explores recursive sorting algorithms, recursion, dynamic programming, and the efficiency of recursive solutions.

Hashing and Sorting Log in to Mediaspace to watch this video

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

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.

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.

Derivatives, O-Notation Log in to Mediaspace to watch this video

Explores derivatives, O-Notation, extrema, and algorithm complexity in Analysis 1.

Insertion Sort: Basics and Analysis Log in to Mediaspace to watch this video

Introduces Insertion Sort, explaining its basics, insertion process, and correctness analysis.

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

Introduces growth of functions, sorting problem, insertion sort, computational model, and merge sort.

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

Introduces the merge sort algorithm through the divide-and-conquer approach, emphasizing correctness and time analysis.

Algorithms in Computer Science: Search and Sort Techniques Log in to Mediaspace to watch this video

Provides an overview of essential search and sort algorithms in computer science.