Question: Insertion sort cost ( n ) = n ( Linear time ) in best case scenario because: Group of answer choices Both loops work in
Insertion sort cost nn Linear time in best case scenario because:
Group of answer choices
Both loops work in opposite direction
No comparison is performed
Outer loop executes only n times
Pivot is always greater than all left values
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
