Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

#94 SearchingaSortedTable #21

Open
cyyeh opened this issue Jan 3, 2017 · 1 comment
Open

#94 SearchingaSortedTable #21

cyyeh opened this issue Jan 3, 2017 · 1 comment
Assignees
@cyyeh

Comments

@cyyeh
Copy link
Collaborator

cyyeh commented Jan 3, 2017

One hundred different numbers are written on 100 cards, one number per card. The cards are arranged in 10 rows and 10 columns, in increasing order in each row (left to right) and each column (top down). All the cards are turned faced down so that you cannot see the numbers written on them. Can you devise an algorithm to determine whether a given number is written on one of the cards by turning up less than 20 cards?
@cyyeh cyyeh self-assigned this Jan 3, 2017
@cyyeh
Copy link
Collaborator Author

cyyeh commented Jan 3, 2017

20張太多了吧....還是我想錯了orz

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees

@cyyeh cyyeh

Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@cyyeh