What is the fastest algorithm to determine if any number in a sorted array is multiple of `x`? – stackoverflow.com

What is the fastest algorithm to determine if any number in a sorted array is multiple of `x`? – stackoverflow.com

05:08 No Comments
Given an positive integer x and a sorted positive integer array A Is there any algorithm faster than O(N) to determine if any element in A is a multiple of x? There are no negative elements in A. ...

from Hot Questions - Stack Exchange OnStackOverflow
via Blogspot

Share this

Unknown

Artikel Terkait

0 Comment to "What is the fastest algorithm to determine if any number in a sorted array is multiple of `x`? – stackoverflow.com"

Post a Comment

Subscribe to: Post Comments (Atom)