Skip to content

Time and Space Complexity (Big O notation)

Jump to bottom
mmedrano9438 edited this page Jan 19, 2024 · 1 revision

Big O notation is a mathematical expression that describes the rate of change of an algorithm's efficiency as its arguments scale up. It is used to express both time and space complexity. Space complexity is related to the memory that needs to be allocated for a function.

Today, all modern browsers support the async and defer attributes on scripts. These attributes tell the browser it's safe to continue loading the page, while the scripts are being downloaded.

Clone this wiki locally