Lecture

Complexity of Algorithms: Advanced Big-O Facts

Description

This lecture covers advanced big-O facts, including big-O estimates for the factorial function, combinations of functions, and the big-O for powers, logarithms, and factorials. It also discusses the big-O for the sum and product of functions.

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.