Intersection algorithm: Difference between revisions

Content deleted Content added
No edit summary
Tags: Mobile edit Mobile web edit
m Fixed a typo found with Wikipedia:Typo_Team/moss.
Line 18:
# [tentative lower endpoint found, initialize to find upper endpoint] set ''endcount''=0.
# [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.
# if ''lower'' ≤ ''upper'' and ''midcount'' ≤ ''f'' then return interval [''lowerendpoint'', ''upperendpoint''] as resulting confidence interval.
#[increment number of falsetickers] ''f'' = ''f''+1. If ''f'' ≥ ''M''/2 then terminate and return FAILED, otherwise goto step 1.