O(1): random access to an…

O(1): random access to an element in a collection, dependent on indexing

O(n): list iterations

O(n^2): nested loops on the same collection

O(log n): divide and conquer

O(n log n): iterations that use divide and conquer

O(n!): adding a nested loop for every input you have
Big-o-complexity-chart

Resource: @DynamicWebPaige

#bigo #big-o