What is the best case for binary search?

In selection sort you need to swap two elements:

Insertion sort and Selection sort have the same time complexity (O-notation).

Insertion sort has a worse case time complexity of O(n)

Bubble sort has a time complexity of O(n)

There is only one way to search for an element in an array.

You can use binary search to search for an element in any (including unsorted) array.

Selection Sort is usually faster than Merge Sort when it comes to its time complexity.

Binary Search works on unsorted arrays.

Bubble sort has a time complexity of O(n log n)