FindSingle complexity

Ask general questions here.
Posts: 6
Joined: Thu Oct 01, 2020 9:34 am
Location: Tampere, Finland

FindSingle complexity

Post by Saf2 » Fri Oct 16, 2020 12:38 pm

What is the complexity of that search algorithm? I am trying to figure out if there is any advantage for using it over a regular O(n) for loop.

User avatar
Ranorex Guru
Ranorex Guru
Posts: 6553
Joined: Mon Aug 13, 2012 9:54 am
Location: Zilina, Slovakia

Re: FindSingle complexity

Post by odklizec » Mon Oct 19, 2020 1:37 pm


I don't think that there is any difference in search algorithm for FindSingle and for example Find, which returns list of elements. The only difference is, that FindSingle returns first found element.
Pavel Kudrys
Ranorex explorer at Descartes Systems

Please add these details to your questions:
  • Ranorex Snapshot. Learn how to create one >here<
  • Ranorex xPath of problematic element(s)
  • Ranorex version
  • OS version
  • HW configuration