When an algorithm has an upper limit to the number of instructions, regardless of the size of n, it is referred to as a(n) ______________ algorithm.

A. limited
B. time complex
C. constant time
D. instruction-truncated


C

Computer Science & Information Technology

You might also like to view...

What is the procurement specialist responsible for?

What will be an ideal response?

Computer Science & Information Technology

Write four different program statements that increment the value of an integer variable total.

What will be an ideal response?

Computer Science & Information Technology

Describe the setup in which a dual-homed host is used.  What are the limitations of this configuration?

What will be an ideal response?

Computer Science & Information Technology

Electronic, cartoon-like images are referred to as ________

Fill in the blank(s) with correct word

Computer Science & Information Technology