Question
Download Solution PDFOrdered pair that represents time complexity of divide phase and combine phase of merge sort algorithm respectively is:
This question was previously asked in
HTET PGT Official Computer Science Paper - 2017
Answer (Detailed Solution Below)
Option 1 : O(1), O(n)
Free Tests
View all Free tests >
HTET PGT Official Computer Science Paper - 2019
60 Qs.
60 Marks
60 Mins
Detailed Solution
Download Solution PDF The total of n elements in the entire array.
- The divide step takes constant time, regardless of the subarray size. It indicates constant time by Θ(1) left parenthesis, 1, right parenthesis.
- The conquer step, where we recursively sort two subarrays of approximately n/2 elements each, takes some amount of time, but we'll account for that time when we consider the subproblems.
- The combined step merges a total of n elements, taking Θ(n), left parenthesis, n, right parenthesis time.
Therefore Answer is Option 1
Latest HTET Updates
Last updated on Jul 12, 2025
-> HTET Exam Date is out. HTET Level 1 and 2 Exam will be conducted on 31st July 2025 and Level 3 on 30 July
-> Candidates with a bachelor's degree and B.Ed. or equivalent qualification can apply for this recruitment.
-> The validity duration of certificates pertaining to passing Haryana TET has been extended for a lifetime.
-> Enhance your exam preparation with the HTET Previous Year Papers.