Complexity of Algorithms: Growth of Functions

In course

Occaecat laboris dolor proident velit ut incididunt officia occaecat in sunt cillum id non. Reprehenderit aliqua laboris cupidatat tempor labore proident sint magna qui. Nisi ad veniam minim laboris Lorem culpa proident aute deserunt amet enim culpa. Dolore id excepteur excepteur et exercitation commodo. Elit eu quis incididunt amet excepteur non tempor cillum.

Description

This lecture discusses the complexity of algorithms by analyzing the growth of functions. It covers the need for precise counting in algorithm efficiency, examples of predicting time for different problem sizes, the estimation of solving time, the relevance of growth rate, and the use of Big-O notation to characterize algorithm efficiency.

Official source

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

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