TLDR
Big O Notation is a special notation that tells you how fast an algorithm is. Time Complexity is a way to measure the performance of an operation based on the size of the input collection. The time it takes to perform an operation is directly related to the number of items in the collection. O(1) is fast. O(n square) is slow. O('n square'): Quadratic. A slow sorting algorithm. A really slow algorithm, like the traveling salesperson.via the TL;DR App
no story
Written by ayoubgholami | a web developer who loves to create something to solve problems
