Compound Arithmetic Function - "Greatest" and "Least"

[DancingDeveloper]

It'd be nice to have a compound arithmetic function of "Greatest" and "Least" which will output the largest or smallest of the input values. It could look like this but with re-sizable input nodes. 

Also, I think the top way is the best way to find the greatest in a set, but let me know if there is a better way. 

[AristosQueue (NI)]

Either of these work for you?

Calling Array Max & Min is way more efficient than sorting the array. Finding the max is a linear operation. Sorting is O(n log n).

The Min & Max is not growable, which is what you requested, so it isn't a direct answer to your ask, but it's closer than your current workarounds.

[wiebe@CARYA]

There is a subtle difference between Array Max & Min and Max & Min. Max & Min will return the min and max of the individual elements, where Array Min & Max will check the first element, and when there are equal values, check the next element.

So a compound min, compound max or compound min & max would add some value.

An alternative Array Min & Max (or option in current function) would also add a bit of functionality (and probably some confusion).

[AristosQueue (NI)]

wiebe: Change modes.

[wiebe@CARYA]

Thanks, I did not know that (or I forgot about it).

Actually, I often want the compare elements mode, but the Array Min & Max doesn't have such an option... So a scalable Compare Elements Min & Max is not available.

Not that I need this that often... A .vim would be easy to make.

But back OT, a compound function for min and max would not be terrible (as long as it has Compare Elements\Compare Aggregates option).

[Darren]

Any idea that has not received any kudos within a year after posting will be automatically declined.