github
/
developer-roadmap
mirror of https://github.com/kamranahmedse/developer-roadmap.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity
Roadmap to becoming a developer in 2022
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
2469 Commits
185 Branches
4 Tags
422 MiB
 
 
 
 
 
Tag: Branch: Tree: 6cc1fc3a5c
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from '6cc1fc3a5c'
${ noResults }
developer-roadmap/content/roadmaps/103-computer-science/content/103-asymptotic-notation
Kamran Ahmed 75843e114f
Add asymptotic notation content 		2 years ago
..
103-common-runtimes Add asymptotic notation content 2 years ago
100-big-o-notation.md Add asymptotic notation content 2 years ago
101-big-theta-notation.md Add asymptotic notation content 2 years ago
102-big-omega-notation.md Add asymptotic notation content 2 years ago
readme.md Add asymptotic notation content 2 years ago

readme.md

Asymptotic Notation

The efficiency of an algorithm depends on the amount of time, storage and other resources required to execute the algorithm. The efficiency is measured with the help of asymptotic notations.

An algorithm may not have the same performance for different types of inputs. With the increase in the input size, the performance will change.

The study of change in performance of the algorithm with the change in the order of the input size is defined as asymptotic analysis.

Free Content

Asymptotic Analysis: Big-O Notation and More Big O Notation — Calculating Time Complexity Big O Notation in 5 Minutes Asymptotic Notation - CS50 CS 61B Lecture 19: Asymptotic Analysis Big-O Cheat Sheet