Question

which of the following algorithims has the smallest time complexity
merge sort
binary search
insertion sort
linear search

Answer 1

The algorithm with the smallest time complexity among the options given is binary search. Its time complexity is O(log n), where n is the number of elements in the sorted array being searched. This time complexity is faster than the others: merge sort has a time complexity of O(n log n), insertion sort has a time complexity of O(n^2), and linear search has a time complexity of O(n).