From Friday, April 19th (11:00 PM CDT) through Saturday, April 20th (2:00 PM CDT), 2024, ni.com will undergo system upgrades that may result in temporary service interruption.
We appreciate your patience as we improve our online experience.
LabVIEW
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? 😄
