Answered step by step
Verified Expert Solution
Question
1 Approved Answer
1) The best case of insertion sort is Select one: a. When the array is not norted b. when the array has distinct items c.
1)
The best case of insertion sort is
Select one:
a.
When the array is not norted
b.
when the array has distinct items
c.
When the array is sorted
d.
No best case
2)
Let array A[] = {20, 22, 33, 36, 38, 49, 50, 61,63, 73, 74, 77, 85, 90, 97} and the search key K =90. In the interpolation search we find the key after
a.
3 iterations
b.
1 iteration
c.
2 iterations
d.
4 iterations
3)
The number of comparisons is required in insertion sort to sort an array if it is already sorted is n-1
Select one:
True
False
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started