Algorithmic Complexity: Big-O Notation

In course

Irure adipisicing mollit consectetur sint nulla id ea est cupidatat anim aliqua consequat. Eiusmod labore sit Lorem dolor velit magna laborum et. Eiusmod pariatur voluptate aliquip ut ullamco non. Consectetur ad mollit aute irure et est cupidatat eiusmod sunt qui amet. Amet nostrud cupidatat et ullamco laboris magna qui consequat deserunt aliquip qui veniam.

Description

This lecture covers the fundamentals of algorithmic complexity, focusing on Big-O notation to analyze the efficiency of algorithms. Topics include logic, mathematical reasoning, basic structures, and growth functions. The instructor explains how to determine time complexity, worst-case complexity, and the efficiency of algorithms through Big-O, Big-Omega, and Big-Theta notations.

Official source

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

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

Number theory: Topics in number theory

Algebra: Abstract algebra

Theoretical computer science

Theory of computation: Computational complexity theory

Related lectures (289)