Lectures related to Untitled | EPFL Graph Search

Complexity & Induction: Algorithms & Proofs

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

Merge Sort: Sorting Algorithm

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

Algorithms in Computer Science: Search and Sort Techniques

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

Sous-algorithmes

Introduces sub-algorithms and the insertion sort algorithm with a focus on pre-sorted elements.

Sorting Algorithms: Selection and Insertion

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

Dynamic Programming: Palindromic Subsequences

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

Optimization Algorithms: Greedy Approach

Explores optimization problems and greedy algorithms for efficient decision-making.

Analysis of Algorithms

Covers the analysis of algorithms, focusing on insertion sort and computational models.

Merge Sort: Divide and Conquer

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

Recursive Sorting: Merge Sort

Explains recursive sorting using Merge Sort and its linearithmic complexity.

Algorithm Design: Divide and Conquer

Covers recursion, dynamic programming, and algorithm design using divide and conquer strategies.

Complexity & Induction: Algorithms & Proofs

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

Transferable Skills in Student Engineering Projects

Delves into the development of transferable skills in student engineering projects, emphasizing interdisciplinary collaboration, project management, and ethical sensitivity.

Merge Sort: Divide, Conquer, Combine

Explores Merge Sort, a sorting algorithm that divides, conquers, and combines arrays efficiently to achieve O(nlog n) time complexity.

Algorithm Complexity Analyses

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

Sorting Algorithms: Sorting Methods and Comparison

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

Calcul and Algorithms: What is an Algorithm?

Covers the basics of algorithms in computer science, including their formalization and complexity.

Search Algorithms: Dichotomy Search

Explores dichotomy search algorithms, analyzing complexity and implementation details for efficient searching in sorted lists.

Untitled

Insertion Sort: Basics and Analysis

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