Question

Complete the following table by specifying algorithm efficiency for : Selection sort, Insertion sort, Binary search, and Linear search. (Efficiency can be one of : log n, n, n²). List algorithms from the most efficient (fastest) to the least efficient (slowest).

  

	ALGORITHM	EFFICENCY
1 most efficient (fastest)
2
3
4 least efficient (slowest)

Answer 1

(Most Efficient)

1.Binary Search

Complexity- log n

2. Linear Search

Complexity- n

3. Insertion Sort

Complexity - n²

4.Selection Sort

Complexity - n²

(Least Efficient)

Reason for the above order:

for 3rd and 4th position, Insertion Sort is better than Selection Sort because the best case complexity of Selection Sort is O(n²) where as Insertion Sort is O(n).

for 3rd and 2nd position, Linear Search Worst-Case Complexity is O(n) as it just needs a single for loop for searching where as worst case complexity ofinsertion sort is O(n²)

for 2nd and 1st position, Binary search searches an element in maximum log(n) time as it uses divide and conquer whereas linear search takes O(n) time.

I hope I solved your query. In the case of doubt feel free to ask in the comment section.