Showing results for 
Search instead for 
Did you mean: 

Searching inside sorted 1D array

@Martin_Henz wrote:

beside the speed of searching with existing methods, why not implementing a binary search? I never need this algorithm, but the implementation needs not much time. It needs less time than to reading this thread.

Anyone interested? I'm willing to share with something like the " Zero Clause BSD" licence.

As I mentioned, the link in my earlier post already shows a binary search implementation that can easily be adapted. (I am not sure if openG has a version). The important thing would be to make it flexible and work for  almost any datatype (i.e. as a  malleable VI). Yes should not be difficult . ... But wait, we already have sets and maps, so what's the point? 😄

LabVIEW Champion. It all comes together in GCentral GCentral
What does "Engineering Redefined" mean??
0 Kudos
Message 11 of 11