Lecture

Complexity of Algorithms: Advanced Big-O Facts

In course

Elit cillum commodo fugiat officia aliqua ullamco labore esse sint. Aliqua enim reprehenderit aute Lorem fugiat sunt eiusmod consequat ad nisi id. Non anim qui fugiat ex. Lorem Lorem pariatur magna dolor anim nulla cillum officia cillum nisi aliqua do proident nostrud. Labore nisi minim et elit qui Lorem sit adipisicing ea non. Duis cillum consectetur eiusmod ea exercitation sit sint laborum et laborum officia cillum nostrud.

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 (40)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.