0 votes 0 votes closed The number of elements that can be sorted in Θ() time using merge sort is, where n is the size of input which can be represented as some power of 2 for some positive integer k: (A) (B) (C) (D) Programming in C discrete-mathematics gatebook + – Sandy Sharma asked Sep 26, 2018 • closed Jan 5, 2019 by Arjun Sandy Sharma 607 views comment Share Follow See all 6 Comments See all 6 6 Comments reply Show 3 previous comments Deepanshu commented Oct 6, 2018 reply Follow Share D NEVER 0 votes 0 votes Naveen Kumar 3 commented Oct 6, 2018 reply Follow Share how D?? 0 votes 0 votes Navneet Kalra commented Oct 6, 2018 reply Follow Share @sandysharma Please provide the solution which is provided in test series.....if the answer is D 0 votes 0 votes Please log in or register to add a comment.