几道 google interview 的题目# Programming - 葵花宝典
s*e
1 楼
1. Given N computers networked together, with each computer storing N integers
, describe a procedure for finding the median of all of the numbers. Assume
that a computer can only hold O(N) integers (i.e. no computer can store all N^
2 integers). Also assume that there exists a computer on the network without
integers, that we can use to interface with the computers storing the integers
.
2. Given the sequence S1 = {a,b,c,d,...,x,y,z,aa,ab,ac.... } and given that
this sequence corresponds (term
, describe a procedure for finding the median of all of the numbers. Assume
that a computer can only hold O(N) integers (i.e. no computer can store all N^
2 integers). Also assume that there exists a computer on the network without
integers, that we can use to interface with the computers storing the integers
.
2. Given the sequence S1 = {a,b,c,d,...,x,y,z,aa,ab,ac.... } and given that
this sequence corresponds (term
