Gerrit Renker 2bbf29acd8 [DCCP] tfrc: Binary search for reverse TFRC lookup
This replaces the linear search algorithm for reverse lookup with
binary search.

It has the advantage of better scalability: O(log2(N)) instead of O(N).
This means that the average number of iterations is reduced from 250
(linear search if each value appears equally likely) down to at most 9.

Signed-off-by: Gerrit Renker <gerrit@erg.abdn.ac.uk>
Acked-by: Ian McDonald <ian.mcdonald@jandi.co.nz>
Signed-off-by: Arnaldo Carvalho de Melo <acme@mandriva.com>
2006-12-03 14:53:27 -02:00
..
2006-12-02 21:32:08 -08:00
2006-12-02 21:24:01 -08:00
2006-11-05 14:11:25 -08:00
2006-12-02 21:30:17 -08:00
2006-08-05 21:15:58 -07:00
2006-12-02 21:21:23 -08:00
2006-12-02 21:24:02 -08:00
2006-12-02 21:21:24 -08:00
2006-11-30 05:24:39 +01:00
2006-09-22 14:53:34 -07:00
2005-04-16 15:20:36 -07:00