contestada

a. What does it mean when we say that an algorithm A is asymptotically more efficient than algorithm B? (AN)

b. Identify and critically explain any two problems associated with stacks when
implemented as an array and explain how these problems can be fixed. (AN)

Respuesta :

Martebi

Algorithm A is said to be more efficient than algorithm B if A  is said to takes smaller time than B for all input sizes and the n size is larger than a value n0 if  n0 > 0.

What are two problems associated with stacks when implemented as an array?

The problems are:

  • Stack memory is said to have a limited size.
  • The total of size of the stack is one that need to be defined before.

What is an algorithm?

An algorithm is known to be a kind of procedure that is said to be used for handling a problem or carrying a computation.

Note that Algorithms functions as an exact list of instructions and thus Algorithm A is said to be more efficient than algorithm B if A  is said to takes smaller time than B for all input sizes and the n size is larger than a value n0 if  n0 > 0.

Learn more about Algorithm  from

https://brainly.com/question/24953880

#SPJ1

Otras preguntas