Lower Saxony Zentralabitur Informatics Practice Questions - Lower Saxony Zentralabitur Informatics (Informatik) Exam

What is the worst-case time complexity of Bubblesort for sorting n elements?

O(n²) O(log n) O(1) O(n log n) always, with no exceptions

Correct Answer:

O(n²)

Access more questions from this quiz

Continue to Lower Saxony Zentralabitur Informatics Practice Questions - Lower Saxony Zentralabitur Informatics (Informatik) Exam for more practice questions and the full quiz experience.

Access More Questions