whoops - typo on my part - I should really read things !
note the parentheses around C3<>C2
Regards the summary LOOKUP calc used in conjunction with above...
LOOKUP is very fast because it utilises binary search algorithm and as such processes only a tiny subset of the precedent range(s)
It follows that where the precedent range is vast the savings can be significant as a result.
Binary Searches of this nature require the data be sorted accordingly.
We use 2 LOOKUPs as it is an approximate match so the 2nd is used to ensure the value returned is for the correct ID - if not result will be 0.
Given the nature of LOOKUP function calculating 2 LOOKUPs per cell will still be blindingly fast.
Bookmarks