Searching and Sorting Techniques

How does binary search improve upon linear search?

• Binary search checks each element one by one like linear search.

• Binary search is faster than linear search because it reduces the search space by half each time.

• Binary search requires more memory than linear search.

• Binary search can only be used on unsorted data.

What is the primary condition for binary search to work?

• The data must be in ascending order.

• The data must be in descending order.

• The data must be random.

• The data must be sorted.

Explain the process of bubble sort in detail.

• Bubble sort is an algorithm that only works on numerical data.

• Bubble sort is a sorting algorithm that repeatedly compares and swaps adjacent elements until the list is sorted.

• Bubble sort uses a divide and conquer strategy to sort elements.

• Bubble sort sorts elements by inserting them into their correct position directly.

In which scenario would you prefer linear search over binary search?

• When the data is unsorted or for small datasets.

• When the dataset is structured as a tree

• When you need to find the first occurrence of an element

• When the data is sorted and large

Describe how linear search works with an example.

• The search divides the list in half and checks the middle element first.

• The search checks all elements in reverse order starting from the last element.

• For example, in a list [3, 5, 2, 8, 1], to find the number 8, the search checks 3 (not a match), then 5 (not a match), then 2 (not a match), then 8 (match found). The search stops here.

• The search uses a binary tree structure to find the number.

What is the difference between linear sort and bubble sort?

• Linear sort can only be used on small datasets.

• Linear sort is generally faster and more efficient than bubble sort.

• Bubble sort is faster than linear sort.

• Linear sort is a type of bubble sort.

Can binary search be applied to unsorted arrays? Why or why not?

• Yes, binary search can be applied to any array.

• Binary search can be used if the array is partially sorted.

• Binary search works on unsorted arrays with a linear search method.

• No, binary search cannot be applied to unsorted arrays.

What is the main advantage of using binary search?

• It can only be used with integer values.

• It requires the dataset to be unsorted.

• It is more efficient than linear search, especially for large datasets.

• It is slower than linear search for small datasets.

Explain how to implement linear search in pseudocode.

• Only check even-indexed elements in the array.

• 1. Start from the first element of the array. 2. Compare the current element with the target value. 3. If they match, return the current index. 4. If not, move to the next element. 5. Repeat steps 2-4 until the end of the array is reached. 6. If the target is not found, return -1.

• Return the first element regardless of the target value.

• Start from the last element of the array.

How does the performance of linear search compare to binary search?

• Linear search is more efficient for large datasets than binary search.

• Binary search is more efficient than linear search, especially for large datasets.

• Binary search can be used on unsorted data.

• Linear search is faster than binary search for all datasets.