logo

Pearson Edexcel GCSE (9-1) Computer Science practice

Which sorting algorithm repeatedly compares adjacent elements and swaps them if they are in the wrong order?

Try the question first, then check the answer and practise the same topic again.

At a glance

MCQ

Type

practice

Style

Topic

Algorithms

Exam-style question

Try this first

Which sorting algorithm repeatedly compares adjacent elements and swaps them if they are in the wrong order?.

  1. A.Merge Sort
  2. B.Binary Search
  3. C.Bubble Sort
  4. D.Linear Search

Answer and explanation

Attempt the question first, then reveal the model answer and explanation.

Common mistake

No common mistake is linked to this question yet.

Related flashcards

Flashcard 1 of 6

Press Space to flip, arrows to move

Related practice questions

No questions are published for this page yet.
Which sorting algorithm repeatedly compares adjacent elements and swaps them if they are in the wrong order? | Edexcel Computer Science | ExamCompanion