Comparison between the minimum and maximum values in a dataset

Comparison between the minimum and maximum values in a dataset

Minimum and maximum

-- Calculate and import notes

The implementation is so simple that no code implementation is introduced in the computing guide, but the theory is briefly introduced.

The method for finding the maximum and minimum values

Method 1:

Void max_min (int * array, int size, int * max) {int tmp = 0; for (tmp = 0, * max = array [0]; tmp <size; tmp ++) {* max = * max> array [tmp]? * Max: array [tmp] ;}}

If the minimum value is the same

It can be found that if the minimum and maximum values need to be found at the same time, 2 * size needs to be compared.

Is there any faster way?

Method 2:

Void max_min (int * array, int size, int * min, int * max) {int tmp = 0; for (tmp = 0, * min = array [0], array [1]; tmp <size; tmp + = 2) {if (array [tmp] <array [tmp + 1]) {* min = * min <array [tmp]? * Min: array [tmp]; * max = * max> array [tmp + 1]? * Max: array [tmp + 1];} else {* min = * min <array [tmp + 1]? * Min: array [tmp + 1]; * max = * max> array [tmp]? * Max: array [tmp] ;}}

This method reduces the number of comparisons to 3 * size/2 times.