Complexity of Algorithms

In course

Nulla commodo ut laborum mollit duis ea quis est. Sit enim ad commodo labore nostrud adipisicing mollit pariatur ad enim est officia elit quis. Laboris sit cupidatat eiusmod excepteur fugiat amet Lorem ad aliquip ad excepteur enim irure. Irure laboris occaecat ut duis culpa minim reprehenderit in labore. Sint magna amet minim cillum labore ex anim commodo ut laboris quis. Cupidatat laborum cillum do deserunt velit est elit.

Description

This lecture covers the complexity of algorithms, focusing on big-O notation for powers, logarithms, and factorials, as well as the efficiency of algorithms in terms of time and space complexity. It also explains big-Omega and big-Theta notations, with examples and summaries.

Official source

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

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