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

Which sorting algorithm repeatedly compares adjacent elements and swaps them if they are out of order?

Hashing Bubblesort Binary search Depth-first search

Correct Answer:

Bubblesort

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