The following algorithm represents the logic of a(n) ____.
For maxElement = ARRAYSIZE - 1 To 1 Step - 1
For index = 0 To maxElement - 1
If someNums[index] someNums[index + 1] Then
Temp = someNums[index]
SomeNums[index] = someNums[index + 1]
SomeNums[index + 1] = temp
End If
End For
End For

A) selection sort
B) insertion sort
C) bubble sort
D) merge sort

Question

The following algorithm represents the logic of a(n) ____.
For maxElement = ARRAYSIZE - 1 To 1 Step - 1
For index = 0 To maxElement - 1
If someNums[index] > someNums[index + 1] Then
Temp = someNums[index]
SomeNums[index] = someNums[index + 1]
SomeNums[index + 1] = temp
End If
End For
End For

A) selection sort
B) insertion sort
C) bubble sort
D) merge sort

Quizplus · Accepted Answer

The algorithm provided is a classic example of bubble sort. It repeatedly steps through the list, compares adjacent elements, and swaps them if they are in the wrong order. The pass through the list is repeated until the list is sorted.

The Following Algorithm Represents the Logic of A(n) ____