Reading Quiz 4

You should express the complexity of an algorithm in terms of it

problem size

Problem size is defined as

the number of items an algorithms processes

An algorithm has

time requirements and space requirements

If an algorithm requires 7 basic operations for an algorithm with a problem size of n, the algorithmic complexity is

O(1)

What is the time complexity for adding an entry to a fixed-size array-based bag ADT?

O(1)

What is the time complexity for adding an entry to a linked-based bag ADT?

O(1)

What is the worst-case time complexity for searching a linked-based bag ADT for a particular entry?

O(n)

For large values of n which statement is true?

(n^2 + n ) / 2 behaves like n^2