4 ms·
At around 32 minutes, he explained that a sufficient implementation of negative infinity would be the smallest possible value representable by the data type (e.
by vages 2y ago
At around 32 minutes, he explained that a sufficient implementation of negative infinity would be the smallest possible value representable by the data type (e.g. 32 bit integers).
- neuroelectron 2y agoi.e. a binary flag or two. as is ISO
- linuxftw 2y agoThat's just moving the problem elsewhere. Since the smallest possible value is a possible value, then it may be present in the array, or it may not actually be present in the array. The caller would have to determine which case is which by testing for the length of the array, which if done, negates the entire utility of returning the smallest possible value.