Plurrrr

Thu 07 May 2020

A Guide to Big O notation

You have probably come across big O notation before. Maybe you have read that merge sort is better than insertion sort because merge sort is O(n log ⁡n) compared to insertion sort, which is O(n2). In this article, you'll understand what this means, and why this makes merge sort the better algorithm.

Source: A Guide to Big O notation, an article by Erik André Jakobsen.