| CARVIEW |
Select Language
HTTP/2 200
content-type: text/html; charset=utf-8
date: Tue, 29 Jul 2025 17:12:08 GMT
permissions-policy: interest-cohort=()
strict-transport-security: max-age=31536000; includeSubDomains
server: nginx
cache-control: s-maxage=59611, max-age=0
x-powered-by: Next.js
etag: "1ef0n46ha8m2m"
content-encoding: gzip
x-xss-protection: 1; mode=block
x-content-type-options: nosniff
referrer-policy: no-referrer-when-downgrade
content-security-policy: default-src 'self' http: https: ws: wss: data: blob: 'unsafe-eval' 'unsafe-inline'; frame-ancestors 'self';
vary: Accept-Encoding
x-cache: Hit from cloudfront
via: 1.1 8b3f40eb1b765416dfc3f89172af0efe.cloudfront.net (CloudFront)
x-amz-cf-pop: BOM78-P9
x-amz-cf-id: KTljghV1rTy6e8-H7E27UghqjVSS4nI9zOCrsHvY1VESbocHdBXtvg==
age: 9064
Algorithms | Sorting | Question 14 
- Courses
- Tutorials
- Practice
- Jobs
Data Structure
Java
Python
HTML
Interview Preparation
Interview Preparation
- Interview Preparation For Software Developers
- Must Coding Questions - Company-wise
- Must Do Coding Questions - Topic-wise
- Company-wise Practice Problems
- Company Preparation
- Competitive Programming
- Software Design-Patterns
- Company-wise Interview Experience
- Experienced - Interview Experiences
- Internship - Interview Experiences
Algorithms | Sorting | Question 14
Last Updated :
Discuss
Comments
In a modified merge sort, the input array is splitted at a position one-third of the length(N) of the array. Which of the following is the tightest upper bound on time complexity of this modified Merge Sort.
N(logN base 3)
N(logN base 2/3)
N(logN base 1/3)
N(logN base 3/2)
This question is part of this quiz :
Top MCQs on Complexity Analysis of Algorithms with Answers,Top MCQs on Sorting Algorithms with Answers,Top MCQs on MergeSort Algorithm with AnswersTags:
Share your thoughts in the comments
GeeksforGeeks
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy