一个有序的整数list,没有duplicates 问怎样查找最快。
Page 1 of 1
一个有序的整数list,没有duplicates 问怎样查找最快。
比如c[a:b],找x
那么binary search就是check c[a+(b-a)/2]
linear interpolation就是check c[a+(b-a)*(x-c[a])/(c[b]-c[a])]
那么binary search就是check c[a+(b-a)/2]
linear interpolation就是check c[a+(b-a)*(x-c[a])/(c[b]-c[a])]
Page 1 of 1
Permissions in this forum:
You cannot reply to topics in this forum
|
|