Explain the terms best case and worst case in terms of an algorithm. The followi

Question

Explain the terms best case and worst case in terms of an algorithm. The following question investigates searching and sorting performance on unsorted arrays. i. In general, sorting an array takes longer than searching for an element in an unsorted array. If this is the case, explain why we would sort an array. ii. What is the complexity of a search on an unsorted array? What is this type of search called? iii. Give the best case and worst case performance of BubbleSort on an unsorted array. Explain the best case performance.

Explanation / Answer

Best Case Analysis:
In best case analysis,we have to calculate lower bound.Foe that we must know the chance which causes minimum number of operations to be executed. For example in the linear search problem,it occures when element is find at the first location.

Worst Case Analysis:
In worst case we calculate analysis of upper bound based on running time.That means we must have to find in case that causes maximum number of operations to be executed. For example in linear Search, the worst case occures when searching element is not present in the array.

1) The main reason behind we are using sorting is that sorting never contains a worst-case less than O(N log N).

2)complexity of a searcing an unsorted array is logn and this type of search calle as binary search.

3)Worst case of Bubble sort is O(n^2)
Best case of Bubble sort is O(n)

Related Questions

Navigate

• Browse (All)
• Browse E
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.