Brain Blitz (Round 2)

Which of the following is a searching algorithm?

• Bubble Sort
• Binary Search
• Insertion Sort
• Merge Sort

Which of the following is a sorting algorithm?

• Linear Search
• Bubble Sort
• Quick Sort
• Hash Table

Which of the following is a disadvantage of linear search?

• It is faster than binary search
• It requires the array to be sorted
• It has a time complexity of O(n)
• It can only be used for small arrays

Which sorting algorithm has the worst time complexity?

• Bubble sort
• Selection sort
• Insertion sort
• Quick sort

Which of the following is a disadvantage of binary search?

• It requires the array to be sorted
• It has a time complexity of O(n)
• It can only be used for small arrays
• It is slower than linear search

Which sorting algorithm has the best time complexity in the average case?

• Bubble sort
• Insertion sort
• Selection sort
• Quick sort

Which search algorithm is faster for small arrays?

• Linear search
• Binary search
• Interpolation search
• Jump search

In which type of search, the elements are compared sequentially with the key element?

• Binary Search
• Linear Search
• Hash Table
• Merge Sort

Which of the following is true about Binary Search?

• It requires the elements to be in a sorted array
• It requires the elements to be in a randomly ordered array
• It does not require the elements to be in any particular order
• None of the above

Which of the following is a characteristic of Binary Search?

• It has a time complexity of O(n)
• It is an in-place searching algorithm
• It compares elements in a random order
• It requires the elements to be in a sorted array