Algorithms & Growth of Functions

In course

Cillum adipisicing eiusmod officia nulla voluptate do incididunt fugiat ad non exercitation qui cillum. Irure velit officia non ut cillum. Ea enim sint esse sit quis qui dolore mollit mollit in cupidatat velit. Quis fugiat sint pariatur commodo occaecat ad consectetur ea aute dolore cillum cupidatat ullamco excepteur. Amet ut velit ut labore do consequat ullamco. Velit ea est irure ea ex officia incididunt enim consectetur cillum. Sunt velit nisi officia quis enim elit exercitation magna commodo culpa ullamco reprehenderit id irure.

Description

This lecture covers the optimization algorithms, including Cashier's algorithm and the Gale-Shapley algorithm for stable matching. It also explains the concept of Big-O notation to analyze algorithm efficiency.

Official source

https://mediaspace.epfl.ch/media/0_61n313ad

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.

Ontological neighbourhood

Mathematics

Analysis: Complex analysis

Mathematical logic: Set theory

Number theory: Topics in number theory

Theoretical computer science

Algorithms and data structures: Combinatorial optimization, Analysis of algorithms

Theory of computation: Computational complexity theory

Logic

Classical logic: First-order logic

Related lectures (206)