Common sorting algorithms are quick sort, heap sort, merge sort. Heap sort has
nlogn order for all cases. Quick sort has average order nlogn but worst case can be n^2. Same with merge sort.

Helpful Answer?

Yes | No

Inappropriate?

0 of 0 people found this helpful

Mar 16, 2012

by Anonymous:

False. Merge sort is always nlogn.

Helpful Answer?

Yes | No

Inappropriate?

To comment on this question, Sign In with Facebook or Sign Up

You might also be interested in: Interview Questions, Software Engineer Interview Questions, Adobe Interview

Employees' Choice Winner: 2009, 2010, 2011

Adobe Overview (ADBE)

Website www.adobe.com

HQ San Jose, CA

Industry

Multimedia, Graphics & Publishing Software

Size

9,900+ Employees, $4B+ Revenue

Competitors

Apple, Microsoft

Adobe – Why Work for Us?

Register today and let new career opportunities at Adobe find you! Whether it's a smartphone or tablet app, a game, a video, a digital magazine, a website, or an online experience, chances are that it was touched by… — Full Overview

Provided by employer [?]

Interviews by Company

Salaries by Company

Tags are like keywords that help categorize interview questions that have something in common.

About Us | Feedback | Help

Glassdoor ® is a registered trademark of Glassdoor, Inc.

Overview

Salaries

Reviews

Interviews

Photos

Jobs

Connections

84 Interview Reviews |

Interview Question for Software Engineer at Adobe:

Explain few sorting algorithm. What are their complexities ?

Answers & Comments (2)

Flag this {0} as inappropriate

Thank you!

Oops!