Home » Technical Questions » Database

The time complexity of sequential search is

Correct Answer: O(n)

Explanation:

The time complexity of sequential search is O(n)


← Previous Question Next Question→

Discussion & Comments

No comments yet. Be the first to comment!
Join Discussion