16 lines
775 B
Markdown
16 lines
775 B
Markdown
|
export const guideMeta = {
|
||
|
|
"title": "WebStorm — Project History",
|
||
|
|
"description": "Learn how to peek through the history of any git repository to learn how it grew.",
|
||
|
|
"url": "/guides/project-history",
|
||
|
|
"fileName": "project-history",
|
||
|
|
"featured": true,
|
||
|
|
"author": "kamranahmedse",
|
||
|
|
"updatedAt": "2020-07-16T19:59:14.191Z",
|
||
|
|
"createdAt": "2020-07-16T19:59:14.191Z"
|
||
|
|
};
|
||
|
|
|
||
|
|
Asymptotic notation is the standard way of measuring the time and space that an algorithm will consume as the input grows. In one of my last guides, I covered "Big-O notation" and a lot of you asked for a similar one for Asymptotic notation. You can find the [previous guide here](/guides/big-o-notation).
|
||
|
|
|
||
|
|
[](/guides/asymptotic-notation.png)
|
||
|
|
|