Basically, do binary search, but go to the place that you expect the number to be on each iteration. Ie, if I have 100 elements and I'm searching for .90, then I'll first go to element 90. If element 90 was .8, then I'll narrow my range: there are now 10 elements, and I'm searching for .9 between .8 and 1, so I'll go halfway through. Etc.

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 Engineering Intern 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,227 Interview Reviews |

Interview Question for Software Engineering Intern at Google:

you have a sorted array of real numbers drawn from the uniform distribution between 0 and 1. How can you quickly find a number in it? This was the last question. They had me implement it on my own and send it back to them.

Answers & Comments (1)

Flag this {0} as inappropriate

Thank you!

Oops!