Higher Standard Algorithms

Reorder the following to create a find minimum algorithm

• min = values(1)

• for x = 2 to arraysize

• end if
  next

• min = values(x)

• if values(x) < min then

Reorder the following to create a find maximum algorithm

• if values(x) > max then

• max = values(x)

• end if
  next

• max = values(1)

• for x = 2 to arraysize

Reorder the following to create a count occurrences algorithm:

• end if
  next

• counter = counter + 1

• if values(x) = "condition" then

• counter = 0

• for x = 1 to arraysize

Reorder the following to create a linear search algorithm:

• counter = 0
  found = false

• do
  if values(x) = target then

• loop until counter = arraysize-1 or found = true

• found = true
  end if

• counter = counter +1

It is more efficient to use a ​ (a)   in a linear search algorithm as the loop will stop repeating when the item is found ​ (b)   or when each item in the array has been traversed. This means the loop is not repeating unnecessarily after the item has been found.

• conditional loop
• fixed loop
• (found = true)
• (found = false)

Which standard algorithm would be used to find the fastest swimmer's time?

• find minimum

• find maximum

• count occurrences

• linear search

Which standard algorithm would be used to find the highest test percentage?

• find maximum

• find minimum

• linear search

• count occurrences