Big O Notation

This content originally appeared on DEV Community and was authored by Nabil Tharwat

This is a submission for DEV Computer Science Challenge v24.06.12: One Byte Explainer.

Explainer

Big O describes the efficiency of the worst case scenario of an algorithm. It helps categorize algorithms, but isn't accurate to describe real performance. An algorithm that does constant time O(1) may be slower due to complexity than a linear one O(N).

This content originally appeared on DEV Community and was authored by Nabil Tharwat

Print Share Comment Cite Upload Translate Updates

APA

Nabil Tharwat | Sciencx (2024-06-21T11:30:50+00:00) Big O Notation. Retrieved from https://www.scien.cx/2024/06/21/big-o-notation-6/

MLA

" » Big O Notation." Nabil Tharwat | Sciencx - Friday June 21, 2024, https://www.scien.cx/2024/06/21/big-o-notation-6/

HARVARD

Nabil Tharwat | Sciencx Friday June 21, 2024 » Big O Notation., viewed ,<https://www.scien.cx/2024/06/21/big-o-notation-6/>

VANCOUVER

Nabil Tharwat | Sciencx - » Big O Notation. [Internet]. [Accessed ]. Available from: https://www.scien.cx/2024/06/21/big-o-notation-6/

CHICAGO

" » Big O Notation." Nabil Tharwat | Sciencx - Accessed . https://www.scien.cx/2024/06/21/big-o-notation-6/

IEEE

" » Big O Notation." Nabil Tharwat | Sciencx [Online]. Available: https://www.scien.cx/2024/06/21/big-o-notation-6/. [Accessed: ]

rf:citation

» Big O Notation | Nabil Tharwat | Sciencx | https://www.scien.cx/2024/06/21/big-o-notation-6/ |

Please log in to upload a file.

There are no updates yet.
Click the Upload button above to add an update.

You must be logged in to translate posts. Please log in or register.