Question: Which sorting algorithm is known for its worst - case time complexity of O ( n ^ 2 ) but performs well on small or
Which sorting algorithm is known for its worstcase time complexity of On but performs well on small or nearly sorted datasets
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
