Skip to content

GH-180: Big-O in General #214

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 5 commits into from
Mar 15, 2023
Merged

GH-180: Big-O in General #214

Changes from all commits
Commits
Show all changes
5 commits
Select commit Hold shift + click to select a range
7a12b00
update
rain1024 Mar 15, 2023
e0a84ea
update
rain1024 Mar 15, 2023
b0ca84d
update
rain1024 Mar 15, 2023
3c2db24
update
rain1024 Mar 15, 2023
bf235ec
update
rain1024 Mar 15, 2023
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
5 changes: 4 additions & 1 deletion concepts/general/big-o.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -4,7 +4,9 @@

> In computer science, the time complexity is the computational complexity that describes the amount of computer time it takes to run an algorithm. Time complexity is commonly estimated by counting the number of elementary operations performed by the algorithm, supposing that each elementary operation takes a fixed amount of time to perform.

![](../abstract/basic-concepts/big-o-notation.png)
<p align="center">
<img src="/concepts/general/basic-concepts/big-o-notation.png" width="600px"/>
</p>

## Constant Run Time

Expand Down Expand Up @@ -164,6 +166,7 @@ Runtime for `combine()` is $O(n^2)$

## 🔗 Further Reading

* [bigocheatsheet.com](https://www.bigocheatsheet.com/)
* [Time complexity](https://en.wikipedia.org/wiki/Time_complexity), wikipedia
* [Space complexity](https://en.wikipedia.org/wiki/Space_complexity), wikipedia
* ▶️ [Asymptotic Notation](https://www.youtube.com/watch?v=iOq5kSKqeR4&ab_channel=CS50), CS50
Expand Down