The correct answer is:
- Time complexity: O(n)
- Space complexity: O(1)
Determine the time and space complexities of a linear search.(1 point) Responses time complexity: O(n) space complexity: O(log(n)) time complexity: upper O left parenthesis n right parenthesis space complexity: upper O left parenthesis log left parenthesis n right parenthesis right parenthesis time complexity: O(log(n)) space complexity: O(n) time complexity: upper O left parenthesis log left parenthesis n right parenthesis right parenthesis space complexity: upper O left parenthesis n right parenthesis time complexity: O(log(n)) space complexity: O(log(n)) time complexity: upper O left parenthesis log left parenthesis n right parenthesis right parenthesis space complexity: upper O left parenthesis log left parenthesis n right parenthesis right parenthesis time complexity: O(n) space complexity: O(n)
1 answer