| Author |
Comment/Response |
John Smith
|
 10/04/00 04:01am
There is one list unsorted. What we want to find is the largest gap between two neighbor elements when this
list is sorted. The time cost should be linear O(n). You can not sort this list. For example, list 5, 17, 12, 20, 100, 1
has the largest gap 100-20=80.
URL: , |
|
