Searching and Sorting Algorithms

Where can Linear Search be performed?

• On letters

• On Numbers

• Both

• None of these

What is an advantage of the Linear search algorithm?

• Performs well with small sized data sets

• Is complicated to code

• Can be used on data sets with more than a million elements

What will happen in a Linear search algorithm if no match is found?

• It continues to search in a never ending loop.

• "Item not found" is returned

What is a disadvantage of the Linear search algorithm?

• It will only work on a sorted data set

• May be too slow to process large data sets

In which of the following cases, binary search algorithm is used?​

• To search an element in an unordered list.​

• To search an element in a list of few elements.

• To search an element in any ordered list with large number of elements.​

Complete the sentence: The lower half of the list is discarded if the value at midpoint is …………………….. item searched.​

• less than​

• greater than​

• equal to

True or False: The upper half of the list is discarded if the value at midpoint is greater than item searched.​

• True

• False

What is the disadvantage of binary search algorithm?​

• It takes longer time when compared to linear search algorithm​

• It works only on sorted lists​

• It is very complex to understand​

Which type of sort algorithm is this?

• bubble

• merge

• insertion

Why does a bubble sort do a final pass even when the data is in the correct order?

• To save the data

• It does not recognise that the data is in order until the final pass requires no changes

• It needs to do this to put the data back in to a list