- O(1) – Constant Time Complexity(Array Lookup, hash table insertion)
- O(log n) – Logarithmic(binary search)
- O(n) – Linear(Printing the elements in an array)
- O(n2) – Quadratic(Constant time operation inside two nested for-loops, comparing 2 integer lists against each other and a bubble sort.)