The Gateway to Computer Science Excellence
0 votes
Upon running  quicksort on a subarray with fewer than k elements, it returns without sorting subarray. After top level call to quicksort returns, insertion sort is run on entire array to finish sorting. Then the sorting algo runs in:

O(n lg(n/k) )   O(n+ n lg(n/k))    O(nk + n lg(n/k))        none
in Algorithms by Junior (867 points) | 133 views

1 Answer

+1 vote

ans is C

by Loyal (7.4k points)
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,336 answers
105,203 users