Quick reference : algorithm complexities ( Big O, linear, .. )

Algorithm complexity denotes the number of steps/operations taken by an algorithm to complete a function with an input size of "n".
This is an important concept used for optimizing and comparison of algorithms.
Below are the concepts defined in simple ideations for quick reference.

For this and more content on react and other programming topics, you can download and use the microideation app for free ( no mandatory registration). You have the ability to view related ideations or to freeze an interesting topic/subject and follow.

https://play.google.com/store/apps/details?id=com.microideation.app

More details
https://www.microideation.com