Question

Determine the time and space complexities of a linear search

1.time compexity:O(log(n))
space compexity:O(n)
2.time complexity:O(n)
space complexity:O(log(n))
3.time complexity:O(log(n))
space complexity:O(log(n))
4.time complexity:O(n)
space complexity:O(n)

Answer 1

[AI-generated answer — Bot GPT 3.5]

The correct time and space complexities for a linear search are:

Time complexity: O(n)
Space complexity: O(1)