Lecture

Complexity of Algorithms

In course

Nostrud consequat esse Lorem deserunt pariatur reprehenderit deserunt est qui quis consequat laboris occaecat. Occaecat id elit cillum anim. Occaecat labore ad id ea adipisicing cillum dolore dolor tempor.

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

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.