Saxony Abitur Informatics Practice Questions - Saxony (Freistaat Sachsen) Abitur Informatics (Informatik) Exam

What is the typical worst-case time complexity of Bubblesort on n elements?

O(1) O(n!) O(n²) O(log n)

Correct Answer:

O(n²)

Access more questions from this quiz

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

Access More Questions