Select Sort, Bubble Sort, Merge Sort

A bubble sort involves finding the smallest item in the unsorted portion of the array and swapping it with the first unsorted item

• True

• False

A selection sort puts one more item into its permanent place after each swap

• True

• False

A merge sort is a “divide and conquer” sort algorithm.

• True

• False

Which of the following sorts is typically the most efficient with large arrays?

• Selection sort

• Bubble sort

• Merge sort

Perform a bubble sort on the list below and keep count of how many swaps you make until the list is sort

[7, 4, 12, 9, 11]

How many swaps are needed to get the original list into the sorted list (least to greatest)?

• 1

• 2

• 3

• 4

Merge-Sort Algorithm consists of repeatedly dividing the list of half-list elements until sub-lists with one element each. The next step is to merge two sublists in an orderly manner from sub-lists with 1 element to the complete list.

• True

• False

The first step of the merge sort is to...

• split the list values into half

• split the list values into pairs

• separate the list values into single data items 

• none of the above 

The next process of the merge sort will require...

• place values into pairs and compare and swap if necessary 

• compare and swap only the paired values from smallest - largest if necessary

• placing the list values into smallest - largest order

• none of the above

It is Friday, March 3, 2023

• True

• False

An algorithm is...

• A set of steps to follow in order

• When you search data for a specific entity

• When you sort data into the correct order