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

O(n lg(n/k) ) O(n+ n lg(n/k)) O(nk + n lg(n/k)) none

- All categories
- General Aptitude 1.9k
- Engineering Mathematics 7.5k
- Digital Logic 2.9k
- Programming and DS 4.9k
- Algorithms 4.4k
- Theory of Computation 6.2k
- Compiler Design 2.1k
- Databases 4.1k
- CO and Architecture 3.4k
- Computer Networks 4.2k
- Non GATE 1.4k
- Others 1.4k
- Admissions 595
- Exam Queries 573
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 18

50,737 questions

57,336 answers

198,448 comments

105,203 users