A Beginner's Guide to The Big O Notationby@vibhorthakral
6,555 reads
6,555 reads

A Beginner's Guide to The Big O Notation

by Vibhor Thakral5mMarch 30th, 2020
Read on Terminal Reader
Read this story w/o Javascript
tldt arrow

Too Long; Didn't Read

Big O Notation is used to describe the performance of an algorithm. Big O is used for the worst-case scenario and the average case scenario of the algorithm. It is the most common Big O notation, the O(n) notation. This article will help you understand the basics of the craziness that is Big O. It will be using JavaScript throughout the article but you can use any language of your choice. The most common notation is O(1), it simply means the operation will always execute in a constant amount of time regardless of how big the input size is.

People Mentioned

Mention Thumbnail
featured image - A Beginner's Guide to The Big O Notation
Vibhor Thakral HackerNoon profile picture
Vibhor Thakral

Vibhor Thakral

@vibhorthakral

L O A D I N G
. . . comments & more!

About Author

Vibhor Thakral HackerNoon profile picture
Vibhor Thakral@vibhorthakral

TOPICS

THIS ARTICLE WAS FEATURED IN...

Permanent on Arweave
Read on Terminal Reader
Read this story in a terminal
 Terminal
Read this story w/o Javascript
Read this story w/o Javascript
 Lite