Lecture

Complexity of Algorithms

In course

Amet cillum ea incididunt duis amet aliquip duis aute sint id. Ex nisi officia et nulla. Minim esse eiusmod laboris sit et aliqua esse pariatur fugiat ad commodo exercitation non id. Aliqua minim irure mollit irure excepteur voluptate esse. Aliqua ea aliqua eiusmod qui veniam cupidatat qui ad cupidatat aliquip. Ad enim ex occaecat consectetur id veniam.

Description

This lecture discusses the complexity of algorithms, focusing on the Big-O notation to analyze the efficiency of algorithms. It covers examples of Big-O estimates for polynomials and the factorial function, as well as combinations of functions. The instructor explains how to abstract from the details of function growth and consider the fastest-growing part for large values.

Official source

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

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

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.