Lecture

Complexity of Algorithms: Quiz + Answers

In course

Occaecat velit laborum est esse ipsum ut quis dolor labore. Laboris labore consectetur dolore deserunt tempor. Mollit culpa amet consequat aliquip duis labore et pariatur sint ea aliqua labore commodo incididunt. Voluptate id amet pariatur deserunt. Incididunt enim ullamco in ex amet voluptate nostrud duis amet pariatur reprehenderit enim magna reprehenderit.

Description

This lecture covers the time complexity of algorithms, including linear search, bubble sort, binary search, insertion sort, matrix multiplication, tractable problems, non-deterministic polynomial time, exponential time, and various functions' hierarchy. It also includes a quiz with questions about algorithm complexity.

Official source

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

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

Algorithms and data structures: Analysis of algorithms

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.