Asked by yes

2. Determine the time and space complexities of a linear search
time complexity: O(n)
space complexity: O(log(n))

time complexity: O(n)
space complexity: O(n)

time complexity: O(log(n))
space complexity: O(n)

time complexity: O(log(n))
space complexity: O(log(n))

Answers

There are no human answers yet.
Answered by GPT 3.5
The correct answer is:

time complexity: O(n)
space complexity: O(1)

Related Questions