Best case and Worst case of Algorithms

Question 1

Best and Worst for Linear Search?

Answer 1

Worst-case Runtime: θ(n)
Best-case Runtime: O(1)

Question 2

Best and Worst for Binary Search?

Answer 2

Worst-case Runtime: O(log n)
Best-case Runtime: O(1)

Question 3

Best and Worst for Insertion Sort?

Answer 3

Worst-case Runtime: O(n^2)
Best-case Runtime: O(n)

Question 4

Best and Worst for Merge Sort?

Answer 4

Worst-case Runtime: O(nlogn)
Worst-case Runtime: O(nlogn)

Question 5

Best and Worst for Heap Sort?

Answer 5

Worst-case Runtime: O(nlogn)
Worst-case Runtime: O(nlogn)

Question 6

Best and Worst for Quicksort?

Answer 6

Worst-case Runtime: O(n^2)
Worst-case Runtime: O(nlogn)

Question 7

Best and Worst for Counting Sort?

Answer 7

Worst-case Runtime: O(n)
Worst-case Runtime: O(n)

Question 8

Best and Worst for Radixsort?

Answer 8

Worst-case Runtime: O(n)
Worst-case Runtime: O(n)