Complexity of Algorithms: Advanced Big-O Facts

In course

Veniam occaecat ea enim ut. Ipsum mollit pariatur magna occaecat deserunt officia id non. Et sit culpa consequat ipsum magna id duis mollit Lorem incididunt amet esse anim magna. In eiusmod ullamco labore reprehenderit cillum enim non aliqua ullamco quis do.

Description

This lecture covers advanced concepts related to the complexity of algorithms, including big-O facts for powers, logarithms, and factorials, as well as the combination of functions. The instructor explains how to estimate the complexity of functions and their combinations using big-O notation.

Official source

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

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

Theoretical computer science

Theory of computation: Computational complexity theory

Related lectures (46)