Sorting and Searching Algorithms Quiz - Batch 1

What is the primary advantage of using binary search over linear search in a sorted array?

• Requires less memory

• Faster search time complexity

• Easier to implement

• Works with unsorted data

What is the time complexity of binary search on a sorted array of size n?

• O(n)

• O(log n)

• O(n log n)

• O(1)

Which of the following algorithms can be used for sorting an array in ascending order?

• Binary Search

• Merge Sort

• Linear Search

• Hashing

Which sorting algorithm is best suited for sorting large datasets that do not fit into memory?

• Quick Sort

• Merge Sort

• Bubble Sort

• Heap Sort

What is the primary purpose of sorting an array before performing binary search?

• To improve search time complexity

• To reduce memory usage

• To simplify the implementation of binary search

• To ensure data is in a random order

After sorting an array, what is the time complexity of performing a binary search?

• O(n)

• O(log n)

• O(n log n)

• O(1)

In which scenario is Linear Search preferred over Binary Search?

• When data is sorted and large

• When data is unsorted and small

• When data is sorted and small

• When data is unsorted and large

Which searching technique is faster for finding a single element in a sorted array?

• Linear Search

• Binary Search

• Interpolation Search

• Jump Search

Which sorting algorithm repeatedly swaps adjacent elements if they are in the wrong order?

• Selection Sort

• Bubble Sort

• Insertion Sort

• Merge Sort

What is the worst-case time complexity of a binary search algorithm?

• O(log n)

• O(1)

• O(n^2)

• O(n)