Sorting, Searching and Big O Review

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 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 

Which type of sort algorithm is this?

• Bubble

• Selection

• Merge

• Purge

Compares pairs of items and swaps them if they are in the wrong order. Each pair in the list is checked.

• Bubble sort
• Insertion sort

Which type of sort algorithm is this?

• Bubble
• Merge
• Insertion

Which algorithm matches this description: "a sorting algorithm that treats the input as two parts, a sorted part and an unsorted part, and repeatedly inserts the next value from the unsorted part into the correct location in the sorted part."

• Selection Sort

• Insertion Sort

• Merge Sort

• Radix Sort