In a binary sort, you continue to compare pairs of items, swapping them if they are out of order, so that the smallest items "bubble" to the top of the list, eventually creating a sorted list.

A) True

B) False

Question

Mathematics

Reginald Potter

8 April, 00:45

In a binary sort, you continue to compare pairs of items, swapping them if they are out of order, so that the smallest items "bubble" to the top of the list, eventually creating a sorted list.

A) True

B) False

+1

Answers (1)

Know the Answer?

Finley Mack · Answer 1

This statement is

A) True

Step-by-step explanation:

Bubble Sort:

Such a binary sort, in which we keep comparing the pairs of items, swapping them if they are not in order, until the smallest item bubble to the top of the list, therefore creating a sorted list which is known as bubble sort.

In a binary sort, you continue to compare pairs of items, swapping them if they are out of order, so that the smallest items "bubble" to the top of the list, eventually creating a sorted list.A) TrueB) False

In a binary sort, you continue to compare pairs of items, swapping them if they are out of order, so that the smallest items "bubble" to the top of the list, eventually creating a sorted list.

A) True

B) False