Complexity of Algorithms

In course

Proident duis irure reprehenderit anim non deserunt. Id veniam enim aute amet id ad ad. Dolor occaecat laboris enim labore magna dolore excepteur tempor tempor nostrud. Exercitation occaecat tempor ex irure est laborum nisi quis sunt anim ad ex. Irure eiusmod sit deserunt esse non velit mollit consectetur nulla. Reprehenderit commodo est enim officia magna eiusmod sunt laboris.

Description

This lecture covers the complexity of algorithms, focusing on big-O notation for powers, logarithms, and factorials, as well as the efficiency of algorithms in terms of time and space complexity. It also explains big-Omega and big-Theta notations, with examples and summaries.

Official source

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

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

Related lectures (58)