Data Structures, Algorithms, Java, Big O Notation, Searching And Sorting.
[https://commons.wikimedia.org/wiki/File:Comparison_computational_complexity.svg] O(n!) (factorial)[Terrible] > O(2^n) (exponential(increment rate increases to endless))[Terrible] > O(n^p) (polynomial)[Terrible] > O(n*logn) (log-linear) [Bad] > O(n) (linear) [Fair] > O(logn) (logarithmic(increment