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

Graph
Search

Course

CS-250: Algorithms I

Summary

The students learn the theory and practice of basic concepts and techniques in algorithms. The course covers mathematical induction, techniques for analyzing algorithms, elementary data structures, major algorithmic paradigms such as dynamic programming, sorting and searching, and graph algorithms.

Lectures

Instructor

Ola Nils Anders Svensson

Official source

https://edu.epfl.ch/coursebook/en/algorithms-i-CS-250

Moodle Page

http://go.epfl.ch/CS-250

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Summary

Lectures

Instructor

Ola Nils Anders Svensson

Official source

https://edu.epfl.ch/coursebook/en/algorithms-i-CS-250

Moodle Page

http://go.epfl.ch/CS-250

About this result

Lectures in this course (105)

Introduction to Algorithms Log in to Mediaspace to watch this video

Introduces the importance of studying algorithms, presents a clever algorithm for calculating an arithmetic series, and discusses efficiency and correctness in algorithms.

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

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

Heaps and Heapsort

Covers heaps, heapsort, heap data structure, storage in arrays, and heap property maintenance.

Prim's and Kruskal's Algorithms Log in to Mediaspace to watch this video

Explores Prim's and Kruskal's algorithms, focusing on greedy approaches and implementation challenges.

Shortest Paths: Negative Weights Log in to Mediaspace to watch this video

Explores Bellman-Ford algorithm for negative weight graphs and currency exchange rates.

Related courses (30)

CS-101: Advanced information, computation, communication I

Discrete mathematics is a discipline with applications to almost all areas of study. It provides a set of indispensable tools to computer science in particular. This course reviews (familiar) topics as diverse as mathematical reasoning, combinatorics, disc ...

CS-450: Algorithms II

A first graduate course in algorithms, this course assumes minimal background, but moves rapidly. The objective is to learn the main techniques of algorithm analysis and design, while building a repertory of basic algorithmic solutions to problems in many ...

PHYS-467: Machine learning for physicists

Machine learning and data analysis are becoming increasingly central in sciences including physics. In this course, fundamental principles and methods of machine learning will be introduced and practised. ...

CS-423: Distributed information systems

This course introduces the foundations of information retrieval, data mining and knowledge bases, which constitute the foundations of today's Web-based distributed information systems. ...

COM-401: Cryptography and security

This course introduces the basics of cryptography. We review several types of cryptographic primitives, when it is safe to use them and how to select the appropriate security parameters. We detail how they work and sketch how they can be implemented. ...