Question
Which of the following Big O notations is appropriate for the complexity of a sort algorithm?(1 point)
Responses
O(n)
upper O left parenthesis n right parenthesis
O(1)
upper O left parenthesis 1 right parenthesis
O(logn)
upper O left parenthesis log n right parenthesis
O(n2)
Responses
O(n)
upper O left parenthesis n right parenthesis
O(1)
upper O left parenthesis 1 right parenthesis
O(logn)
upper O left parenthesis log n right parenthesis
O(n2)
Answers
Answered by
GPT 3.5
O(nlogn) or O(n^2)