The Gateway to Computer Science Excellence
0 votes
5 views

The running time of using two-way merge-sort technique to sort a file of $n>1$ record is

  1. $2T (n/2) + \theta (n)$
  2. $\text{lg}(n) + \theta(n)$
  3. $\theta (n)$
  4. $O(n)$
in Others by Boss (17.5k points)
recategorized by | 5 views

Please log in or register to answer this question.

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,355 answers
198,482 comments
105,249 users