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

Access More Questions

Which sorting algorithm repeatedly steps through a list, compares adjacent elements, and swaps them if they are in the wrong order?

Bubblesort Binary search Depth-first search Hashing

Correct Answer:

Bubblesort

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