Big O Notation Guide for Beginners
27.09.2020

The Big O notation is used in computer science to describe the performance or complexity of an algorithm. Big O specifically describes the worst-case scenario, and can be used to describe the time or space (e.g., in memory or on disk) required by an algorithm.

Anyone who has read Programming Pearls or any other computer science books without a strong mathematics background might hit a wall when they reach chapters mentioning O(N log N) or other seemingly arcane syntax.

This article aims to help you understand the basics of Big O and logarithms.

1/11 | Next >>
English
Home