What is the name for a simple sorting algorithm that repeatedly swaps adjacent elements if they are in the wrong order?
Difficulty: Easy
About this MCQ
This Easy Algorithms question asks: What is the name for a simple sorting algorithm that repeatedly swaps adjacent elements if they are in the wrong order? The correct choice is C. Bubble sort. Read the options below, commit to one, then use the explanation to see why that choice holds and why the others do not.
Algorithms items like this one are written for Pakistan exams such as CSS, FPSC, PPSC, and NTS. The difficulty label is a hint about how much of the topic the stem assumes, not a score. Tags and exam names, when they are present, tell you where else the same idea is tested. Previous and next links stay in Algorithms so you can continue the subject. Related questions point at nearby stems if you want another angle on the same idea.
Treat the explanation as part of the question, not a footnote. If you missed it, reread the stem against the correct option before you open the next Algorithms item. A timed quiz is the same pool with a clock and a score. A past paper is a full sitting rather than this single question.
- A. Backtracking
Why not A: “Backtracking” does not fit this question. The answer is Bubble sort.
- B. Time complexity
Why not B: “Time complexity” does not fit this question. The answer is Bubble sort.
- C. Bubble sort ✓
- D. Greedy algorithm
Why not D: “Greedy algorithm” does not fit this question. The answer is Bubble sort.
Correct answer
C. Bubble sort
Explanation
Bubble sort is the value that answers “What is the name for a simple sorting algorithm that repeatedly swaps adjacent elements if they are in the wrong order” (option C). Option A (Backtracking) does not fit this question. Option B (Time complexity) does not fit this question. Option D (Greedy algorithm) does not fit this question. For this Algorithms question, the accepted answer is Bubble sort.
Source: Algorithms Official Reference Guide
Tags: computer science, algorithms, problem solving, complexity analysis
Submitted by: MCQsHub Editorial
Related MCQs
- Which term refers to a search algorithm that repeatedly divides a sorted array in half to locate a target valu...
- Identify the correct concept described as: a divide-and-conquer sorting algorithm that splits the array, sorts...
- Merge sort is best defined as which of the following?
- A divide-and-conquer sorting algorithm that partitions elements around a pivot value. What is this concept cal...
- Choose the correct description of Quick sort.
- Which of the following best names the concept in which an algorithmic technique that solves problems by breaki...