| CARVIEW |
Select Language
HTTP/2 200
content-type: text/html; charset=utf-8
date: Fri, 22 Aug 2025 03:54:52 GMT
permissions-policy: interest-cohort=()
strict-transport-security: max-age=31536000; includeSubDomains
server: nginx
cache-control: s-maxage=64694, max-age=0
x-powered-by: Next.js
etag: "lrw3sx90gz9tin"
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: Miss from cloudfront
via: 1.1 473a7327891bdce42eed5ffe7062b9f6.cloudfront.net (CloudFront)
x-amz-cf-pop: BOM78-P9
x-amz-cf-id: 49gUq0p2mNqHjsQAj_RzW0gVyLi4Hmix4yhf10Xr0q76vIaEf9p3ow==
GATE | CS | 2012 | Algorithms | Complexity Analysis | Question 39 
- 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
GATE | CS | 2012 | Algorithms | Complexity Analysis | Question 39
Last Updated :
Discuss
Comments
A list of n strings, each of length n, is sorted into lexicographic order using the merge-sort algorithm. The worst case running time of this computation is
O(n log n)
O(n2 log n)
O(n2 + log n)
O(n2)
This question is part of this quiz :
GATE CS 2012,Algorithms GATE CS PYQ Quiz,Complexity Analysis GATE CS PYQ QuizShare 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