FindSingle complexity
FindSingle complexity
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.
Re: FindSingle complexity
Hi,
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.
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 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
