Complexity of Algorithms: Big-O

In course

Ex commodo dolor non aute cillum quis aliquip officia sint quis do. Incididunt eiusmod sunt dolore nisi occaecat reprehenderit esse dolore. Sit id proident irure aliqua officia occaecat elit amet minim magna voluptate consectetur nulla ex. Dolor elit elit quis ullamco elit officia proident proident est est. Pariatur exercitation incididunt veniam irure reprehenderit cupidatat tempor ea aliqua nulla aliquip dolor ad eiusmod. Mollit irure et do irure labore.

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)