Robert Bosch Searching and Sorting Quiz 1

Quick sort is a sorting algorithm, not a searching algorithm.

Binary search is the most efficient algorithm to search for an element in a sorted array.

The time complexity of binary search algorithm in the worst case scenario is O(log n).

Merge sort is a divide and conquer algorithm for sorting.

The time complexity of merge sort algorithm in the worst case scenario is O(n log n).

Selection sort is used to sort elements by repeatedly finding the minimum element from the unsorted part and putting it at the beginning.

The time complexity of selection sort algorithm in the worst case scenario is O(n^2).

Bubble sort is used to sort elements by comparing adjacent elements and swapping them if they are in the wrong order.

The time complexity of bubble sort algorithm in the worst case scenario is O(n^2).

Quick sort has the best average-case time complexity among the given options.