Complexity of Algorithms: Big-O

In course

Do non laboris id duis consequat velit adipisicing elit officia duis est id. Exercitation culpa consequat do id laborum cupidatat eiusmod amet cupidatat enim ea pariatur occaecat. Proident adipisicing proident sunt officia laborum et exercitation in reprehenderit aliqua. Ex eiusmod voluptate occaecat esse nisi consequat do irure in aute do cillum aliquip do. Adipisicing sint elit proident ex. Commodo proident ut aute enim eiusmod magna consectetur mollit culpa nostrud ipsum. Cupidatat sunt veniam non id pariatur proident fugiat.

Description

This lecture covers the concept of Big-O notation, illustrating how to determine the complexity of algorithms by analyzing polynomials. Through examples and proofs, the instructor explains how to identify the dominant terms in polynomials and their growth rates.

Official source

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

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

Theoretical computer science

Theory of computation: Computational complexity theory

Mathematics

Analysis: Numerical analysis

Related lectures (47)