Question

The main goal of Module 7 is understanding the basic pseudocode structures and the three algorithms listed in the objectives: linear search, binary search, and bubble sort. For this discussion, please make observations about one or more of these three algorithms. Here are examples of the kinds of questions your observations might address. What assumption does an algorithm make about the input list of numbers? Which of the two searches is more efficient? What is the purpose of one of the algorithms? You also might make an observation about how an algorithm applies to a list of a certain form.

Answer 1

What assumption does an algorithm make about the input list of numbers?

The binary search is only possible for the sorted, since after checking the middle/center element, it will bifurcate the arrays into two parts, depending upon the pivot value and then iterate. The linear search doesn't required the sorted array, since it is a term by term comparison

Which of the two searches is more efficient?

The binary search is more efficient to find a particular number rather the linear search. The binary search completes the search operation in O(log n) time, whereas the linear search will take O(n), since it will traverse the complete list.

The binary search will divide the array into two parts, then depending on the pivot, then in each step, the focus array will be divided into n/2.

What is the purpose of one of the algorithms?

The bubble sort helps in sorting the input array from lowest value to highest value. It helps in forming an ascending order list of the input numbers

You also might make an observation about how an algorithm applies to a list of a certain form.

The bubble sort or any sorting of number is required for the binary search to search for an element effectively in O(log n) time

Note - Post any doubts/queries in comments section. Rate the answer positive if found helpful