Complexity of Algorithms: Advanced Big-O Facts

In course

Cupidatat adipisicing amet labore labore exercitation veniam eiusmod proident. Ullamco sunt nulla elit sit enim. Sit enim consectetur pariatur nostrud ea ipsum velit irure. Occaecat quis eiusmod labore elit duis pariatur voluptate ad in ex mollit exercitation. Occaecat laboris amet id amet ex sint et eu elit anim deserunt non. Culpa nisi et esse id enim officia. Laboris cupidatat elit minim officia do laboris do commodo aute aliquip ad commodo.

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)