ask for clarification...quicksort and mergesort can both do it in O(nlogn) but quicksort can be as bad as O(n^2)..if there are no space constraints mergesort would be a better choice but if there are space constraints quicksort can be done in place. question is too vague to be answered without followup.

Helpful Answer?

Yes | No

Inappropriate?

3 of 3 people found this helpful

Oct 2, 2011

by coder:

use external sorting.
it has this sort-merge steps (the basic external sort).
divide millions of records in to chunks.
first sort chunks and then merge them.

refer wikipedia for a better explanation.

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, Senior Software Engineer Interview Questions, Google Interview

Employees' Choice Winner: 2009, 2010, 2011, 2012

Google Overview (GOOG)

Edit

Website www.google.com

HQ Mountain View, CA

Industry

Internet Search & Navigation Services

Size

32,400+ Employees, $23B+ Revenue

Competitors

Microsoft, Apple, Facebook

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

1,230 Interview Reviews |

Interview Question for Senior Software Engineer at Google:

what is the best way to sort millions of records

Answers & Comments (2)

Flag this {0} as inappropriate

Thank you!

Oops!