Intersection algorithm: Difference between revisions

Revision as of 06:31, 7 June 2005

Revision as of 14:00, 26 July 2005

Line 21:

4) [determine number of midpoints] Start from end of list and work towards lower offsets. ''endcount'' = ''endcount''+''type''. If ''endcount'' ≥ ''m''−''f'' then ''upper'' = ''offset'', goto step 5. If ''type'' = 0 then ''midcount'' = ''midcount''+1. Repeat for next tuple. If reach end of list then goto step 6.

5) if ''lower'' ≤ ''upper'' and ''midcount'' ≤ ''f'' then return interval [''lowerendpoint'',''upperendpoint''] as resulting confidence interval.

6) [increment number of falsetickers] ''f'' = ''f''+1. If ''f'' ≥ ''m''/2 then terminate and return FAILED, otherwise goto step 1.