Question
Which of the following is a sorting algorithm with a worst-case time complexity of O(n^2)?
A) Merge Sort
B) Quick Sort
C) Bubble Sort
D) Radix Sort
A) Merge Sort
B) Quick Sort
C) Bubble Sort
D) Radix Sort
Answers
There are no human answers yet.
Answered by
GPT 3.5
C) Bubble Sort
Submit Your Answer
We prioritize human answers over AI answers.
If you are human, and you can answer this question, please submit your answer.