Question

Match each problem to the time complexity class it likely belongs to:

1. O(1): Constant
2. O(n): Linear
3. O(n!): Factorial
4. O(logn): Logarithmic
5.O(n2): Quadratic
6. O(n3): Cubic

OPTIONS:

a. Find an element in an unsorted array

b. Shortest path between two nodes in a graph

c. Matrix multiplication

d. Generate permutations of a string

e. Add an element to the front of a linked list

f. Find an element in a binary search tree

Answer 1

Answer:

a Find an element in an unsorted array --------------O(n)

b.shortest path between two nodes in a graph--------------O(n^2)

c.matrix multiplication ------------O(n^3)

d.Generate permutation of string--------------(n!)

e.add an element to the front of linked list---------O(1)

f.Find an element in a binary search tree-------------O(log n)