Big-O Notation Reference

Dustin Boston ·

This chart matches common Big-O notations with their names and relative performance ratings. Is illustrates how an algorithm's efficiency worsens as its computational complexity grows.

NotationNamePerformance
O(1)ConstantExcellent
O(log n)LogarithmicGood
O(n)LinearFair
O(n log n)LinearithmicBad
O(n^2)QuadraticHorrible
O(2^n)ExponentialHorrible
O(n!)FactorialHorrible

Comments

Leave a comment

No comments yet. Be the first to share your thoughts!

Mentions

No mentions yet — link to this post from your site using Webmention and it will show up here.