Search and Sort Algorithms

What is the time complexity of Linear Search?

• O(log n)

• O(n)

• O(n^2)

• O(1)

Explain how Binary Search works.

• Binary Search has a time complexity of O(n^2)

• Binary Search is a linear search algorithm

• Binary Search can only be applied to sorted arrays

• Binary Search is an efficient algorithm with a time complexity of O(log n) where n is the number of elements in the array.

How does Bubble Sort algorithm work?

• Bubble Sort algorithm compares each pair of adjacent items and swaps them if they are in the correct order.

• Bubble Sort algorithm compares each pair of adjacent items and swaps them if they are in the wrong order.

• Bubble Sort algorithm sorts the array by dividing it into subarrays and merging them.

• Bubble Sort algorithm randomly shuffles the elements in the array.

What is the time complexity of Selection Sort?

• O(n^2)

• O(nlogn)

• O(1)

• O(n)

Describe how Insertion Sort algorithm functions.

• Insertion Sort algorithm functions by removing the smallest element from the array

• Insertion Sort algorithm functions by randomly shuffling the elements in the array

• Insertion Sort algorithm functions by comparing the first and last elements of the array

• Insertion Sort algorithm functions by repeatedly taking an element from the unsorted part of the array and inserting it into its correct position in the sorted part of the array.

When is Linear Search preferred over Binary Search?

• When the list is not sorted or sorting the list is costly.

• When the list is already sorted

• When the search is for the last element in the list

• When the list is very small

What is the main difference between Bubble Sort and Selection Sort?

• Bubble Sort sorts elements in descending order, while Selection Sort sorts in ascending order.

• The main difference is in the way elements are compared and swapped: Bubble Sort compares adjacent elements, while Selection Sort selects the smallest element.

• Bubble Sort always performs better than Selection Sort in terms of efficiency.

• Bubble Sort has a time complexity of O(n log n), while Selection Sort has a time complexity of O(n^2).

Why is Binary Search more efficient than Linear Search?

• Binary Search divides the search space in half with each comparison.

• Binary Search has a higher time complexity than Linear Search

• Binary Search is not suitable for sorted arrays

• Binary Search always performs more comparisons than Linear Search

What is the worst-case time complexity of Bubble Sort?

• O(nlogn)

• O(n)

• O(n^2)

• O(1)

Compare the time complexity of Insertion Sort and Selection Sort.

• O(n^2)

• O(n)

• O(nlogn)

• O(n^3)