Complexity of Algorithms: Growth and Laws

In course

Fugiat nostrud culpa aliqua occaecat. Tempor Lorem est esse in sunt. Ea nulla tempor magna do in laborum deserunt labore nostrud consectetur est cupidatat. Commodo cillum excepteur exercitation enim nisi. Enim velit velit officia mollit commodo velit amet fugiat do minim duis. Exercitation cupidatat nostrud mollit esse do ipsum velit esse aute mollit. Enim duis adipisicing quis ex in ullamco officia irure occaecat.

Description

This lecture covers the growth of functions, basic laws of complexity, big O notation, hierarchy of functions, and time complexity analysis for linear and binary search algorithms.

Official source

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

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