algorithms

what is bubble sort?

• simple sorting algorithm that builds the final sorted array (or list) one item at a time

• a simple sorting algorithm that repeatedly steps through the list to be sorted, compares each pair of adjacent items and swaps them if they are in the wrong order

• sorting technique based on divide and conquer technique

• is a search algorithm that finds the position of a target value within a sorted array.

• none of the above.

what is binary?

• is a search algorithm that finds the position of a target value within a sorted array

• sorting techniques based on divide and conquer technique

• a simple sorting algorithm that repeatedly steps through the list to be sorted, compares each pair of adjacent items and swaps them if they are in the wrong order

• a simple sorting algorithm that builds the final sorted array (or list) one item at a time

• none of the above

bubble sort - 13, 16, 10, 11, 4, 12, 6, 7

• 13,16,10,11,4,12,6,7

  13,16,10,11,4,12,6,7

  13,10,16,11,4,12,6,7

  10,13,16,11,4,12,6,7

  10,13,11,16,4,12,6,7

  10,11,13,6,4,12,6,7

  10,11,13,4,16,12,6,7

  10,11,4,13,16,12,6,7

  10,4,11,13,16,12,6,8

• 13,16,10,11,4,12,6,7

  13,16,10,11,4,12,6,7

  13,10,16,11,4,12,6,7

  10,13,16,11,4,12,6,7

  10,13,11,16,4,12,6,7

  10,11,13,16,4,12,6,7

  10,11,13,4,16,12,6,7

  10,11,4,13,16,12,6,7

  10,4,11,13,16,12,6,7

• 13,16,10,11,4,12,6,7

  13,16,10,11,4,12,6,7

  13,10,7,11,4,12,6,7

  10,13,16,11,4,12,6,7

  10,13,11,16,4,12,6,7

  10,11,13,16,4,12,6,7

  10,11,13,4,16,12,6,7

  10,11,4,13,16,12,6,7

  10,4,11,13,6,12,6,7

• 13,16,10,11,4,12,6,7

  13,16,10,11,4,12,6,7

  13,10,16,11,4,12,6,7

  10,13,16,11,4,12,6,7

  1,13,11,16,4,12,6,7

  10,11,13,16,4,12,6,7

  10,11,13,4,16,12,6,7

  10,11,4,13,16,12,6,7

  10,4,11,13,16,12,6,6

• none of the above

how many comparisons - 6, 2, 3, 5, 4

• 4

• 6

• 2

• 7

• none of the above

A Linear search algorithm requires data to be ordered.

• True
• False

What is an advantage of the Linear search algorithm?

• Performs well with small sized data sets
• Can be used on data sets with more than a million elements
• Is complicated to code

If the data is in order the best search to use would be a

• Binary Search
• Linear Search

'The algorithm is longer and more complex to write' is a disadvantage for a 

• Binary Search
• Linear Search