Calcul and Algorithms: What is an Algorithm?

Related lectures (18)

Page 1 of 2

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

Covers worst-case complexity, algorithms, and proofs including mathematical induction and recursion.

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

Explores practical aspects of solving parity games, including winning strategies, algorithms, complexity, determinism, and heuristic approaches.

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

Explores worst-case complexity, mathematical induction, and algorithms like binary search and insertion sort.

Explores dynamic programming for palindromic subsequences, merging binary search trees, and finding the median of two sorted arrays.

Explores linear search, insertion sort, coin change, maximum matching, and the halting problem in algorithms.

Covers the complexity analyses of algorithms and their worst-case time complexities.