Answer the following questions below include algorithms and pseudocode describing the time and space complexity of algorithms:
what is time complexity?
what is space complexity?
compare and contrast polynomial time algorithms and nondeterministic polynomial (np) time algorithms (one paragraph minimum).
provide an example of an algorithm for each worst-case run times:
o( n).
o( nk). note that this is called polynomial-time, where k is any number greater than 1.
np-time.
hint: quick sort is an algorithm that runs in o( nlog n) time