Sort and Search Algorithms

What is a Binary Search?

• An algorithm to search unordered data

• An algorithm to search ordered data

• A method of sorting data by dividing a list into two sub-lists and then repeating the process until all elements are in order.

• A method of sorting data by inserting each element into the correct order.

What is a Linear Search?

• An algorithm to search unordered data

• An algorithm to search ordered data

• A method of sorting data by dividing a list into two sub-lists and then repeating the process until all elements are in order.

• A method of sorting data by inserting each element into the correct order.

What is a Merge Sort?

• An algorithm to search unordered data

• An algorithm to search ordered data

• A method of sorting data by dividing a list into two sub-lists and then repeating the process until all elements are in order.

• A method of sorting data by inserting each element into the correct order.

What is an Insertion Sort?

• An algorithm to search unordered data

• An algorithm to search ordered data

• A method of sorting data by dividing a list into two sub-lists and then repeating the process until all elements are in order.

• A method of sorting data by inserting each element into the correct order.

What is the process involved in a Binary Search (Why is it called Binary Search)?

• Data in a list is divided by 2 to find the mid point. The data is then compared with the desired result and half of the list is ignored. The process is repeated until the desired result is found.

• Data is compared with the desired result from the start of the list until the end of the list or until the desired result is found.

• Data is converted into Binary and then the desired result is found.

• Data is converted into Hexadecimal and then the desired result is found.

What is the process involved in a Linear Search?

• Data in a list is divided by 2 to find the mid point. The data is then compared with the desired result and half of the list is ignored. The process is repeated until the desired result is found.

• Data is compared with the desired result from the start of the list until the end of the list or until the desired result is found.

• Data is converted into Binary and then the desired result is found.

• Data is converted into Hexadecimal and then the desired result is found.

What is the main advantage of a Binary Search?

• It is efficient and the result can be found in a few steps, normally a maximum of 8 steps.

• It can be performed on unordered data.

• It takes a long time to perform a search and is based upon traditional searches carried out on magnetic tape.

• It is similar to sorting a pack of cards.

What is the main disadvantage of a Linear Search?

• It is efficient and the result can be found in a few steps, normally a maximum of 8 steps.

• It can be performed on ordered data.

• It takes a long time to perform a search and is based upon traditional searches carried out on magnetic tape.

• It is simple.

What is missing from the following pseudo-code?

found = False

list = [cat, fish, rabbit, dog]

for item in range (list):

if item == desired data:

found = ______

print(item)

else:

print ("Error data not found.")

list_item =+ 1

• False

• True

• item

• list

How many steps will it take to find x using a Binary search?

[a, b, d, e, x, y, z]

• 1

• 2

• 3

• 4