Computing Sort and Search Algorithms

Which best describes a bubble sort algorithm?

• Order the array, find the midpoint, remove values above or below

• Look at each value individually until you find the correct one

• Compare two values, order them repeat

• Split the array until you left with individual numbers and order them

Data needs to be ordered is a disadvantage of which algorithm?

• Merge sort

• Binary search

• Linear search

• Bubble sort

How many times should you split an array for a merge sort?

• Until the list is in singles

• 2

• 3

• Until the list is in pairs

Which is an advantage of a linear search?

• Data needs to be ordered

• Quick over a large array

• You may have to search the whole array

• Simple to code

Which best describes a merge sort algorithm?

• Order the array, find the midpoint, remove values above or below

• Look at each value individually until you find the correct one

• Compare two values, order them repeat

• Split the array until you left with individual numbers and order them

Which best describes a linear search?

• Order the array, find the midpoint, remove values above or below

• Look at each value individually until you find the correct one

• Compare two values, order them, repeat

• Split the array until you left with individual numbers and order them

Which best describes a binary search?

• Order the array, find the midpoint, remove values above or below

• Look at each value individually until you find the correct one

• Compare two values, order them repeat

• Split the array until you left with individual numbers and order them

How many passes does it take to complete the following bubble sort without a check?

2 6 8 3 7

• 2

• 1

• 4

• 3

Linear search: How many numbers do you have to look through to find the number 45 from this array?

43 67 78 123 45 734 7 2 545 6

• 6

• 7

• 5

• 1

Binary search: How many passes does it take to find the number 13 in this array?

1, 1, 2, 3, 4, 6, 7, 9, 11, 13, 17, 18, 19, 23, 25, 83, 768

• 3

• 5

• 6

• 4