in reply to Re^9: Data visualisation.
in thread Data visualisation.
so the number of calls to chk_triangle_inequality during the exhaustive check for your dataset is n!/((n-2)!*2!). For your dataset, it's 680 calls, and 2024 for Dirk80's dataset.
Indeed. I found completely the wrong formula.
(BTW: it is simply all combinations of 3 from N; so if you have a calculator with an nCr button ... )
|
|---|