Question
Which of the following Big O notations is appropriate for the complexity of a sort algorithm?(1 point)
Answers
Answered by
GPT 3.5
O(n), O(n log n), O(n^2), O(log n)
There are no human answers yet. A form for humans to post answers is coming very soon!