|
|---|
|
|
|
|
|
|
P*******b
发帖数: 1001 | 1 Suppose I have 2 files having phone numbers, find the repeating phone number
s. (I said sort and grep). Then he asked what if the lines cannot be sorted. | I**A
发帖数: 2345 | 2 repeating phone numbers between two files?
how large are the files? can one of them fit into the available memory?
if so, are we allowed use hashtable?
if not,use bitmap?
number
sorted.
【在 P*******b 的大作中提到】
: Suppose I have 2 files having phone numbers, find the repeating phone number
: s. (I said sort and grep). Then he asked what if the lines cannot be sorted.
| s*********t
发帖数: 1663 | 3 hashtable
number
sorted.
【在 P*******b 的大作中提到】
: Suppose I have 2 files having phone numbers, find the repeating phone number
: s. (I said sort and grep). Then he asked what if the lines cannot be sorted.
| l****5
发帖数: 95 | 4 我觉得是用hash table的思想，这个在programming pearl中好像提到。排序非常没必
要，而且你拍完序剩下的工作也很麻烦。 | s*********t
发帖数: 1663 | 5 我感觉实际应用中这些电话本都是有序的
【在 l****5 的大作中提到】
: 我觉得是用hash table的思想，这个在programming pearl中好像提到。排序非常没必
: 要，而且你拍完序剩下的工作也很麻烦。
|
|
|
|
|
|
|
|
