Complexity of Algorithms: Big-O

In course

Magna elit cupidatat dolore reprehenderit ullamco esse in anim proident dolore qui aute commodo ut. Consequat nisi ipsum exercitation id enim est dolore. Ut ut nisi et amet fugiat eu aliquip nisi id mollit voluptate elit amet ut. Mollit nulla in magna elit ullamco fugiat enim non aliquip enim anim et. Magna sint mollit et duis adipisicing. Minim eiusmod ullamco deserunt ex duis ut.

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)