Aug. 29, 2021
9:35 p.m.
On 27Aug2021 15:50, Finn Mason <finnjavier08@gmail.com> wrote:
Perhaps a math.hasnan() function for collections could be implemented with binary search?
math.hasnan(seq)
Why would a binary search be of use? A staraight sequential scan of the sequence seems the only reliable method. Binary search is for finding a value in an ordered sequence. Cheers, Cameron Simpson <cs@cskk.id.au>