Find the position of the maximum and minimum values in array a

A one-dimensional array is a data structure composed of a series of values arranged in a certain order, and solving the maximum and minimum values of a one-dimensional array is a common problem encountered in daily programming. The maximum and minimum values of a one-dimensional array are required, and the cyclic forest comparison method can be used for this brigade. i.e. iterate through the entire array, compare each element with the known maximum and minimum values, and update the maximum value to that element if the current element is larger than the known maximum value; If the current element is smaller than the known minimum, the minimum value is updated to that element.

Ultimately, the maximum and minimum values returned by the program are the results we are asking for.

In addition to round-robin comparison, we can also use sorting algorithms to solve for the maximum and minimum values of a one-dimensional array. By sorting the array, we can get the maximum and minimum values directly. Common sorting algorithms include bubble sorting, insertion sorting, quicksorting, etc.

Among them, the quicksort algorithm is the most efficient, and its time complexity is o(nlogn).

The maximum and minimum values of one-dimensional arrays are not only problems to be solved in conventional programming, but also have a wide range of applications in data processing and statistical analysis. For example, in investment, we need to find out the maximum and minimum values through statistical analysis in order to make reasonable investment decisions; In meteorology, we need to process the temperature data to find the highest and lowest values for future weather trends.

In short, solving the maximum and minimum values of one-dimensional arrays is a common programming problem, and in the process of solving the problem, the loop comparison method and the sorting algorithm are two commonly used methods, and they can also be extended to a wider range of application scenarios, which has important practical significance. <>

Give an example of bumping. For example, there are several high land records as follows:

Step 1: Enter the male laughing formula in C2: =date(int((month(a2)+,if(mod(month(a2)+b2,12)=0,12,mod(month(a2)+b2,12)),day(a2)). The results are shown in the figure

For example, if the function y=ax(a>0, and a≠1) is the sum of the maximum and minimum values on [1,2] is 6, find the value of a.

Since y=ax(a>0, and a≠1) increases monotonically on r, the minimum value is obtained at x=1 and the maximum value is obtained at x=2, i.e., a1+a2=3a=6, so a=2 [conforms to a>0, and a≠1].

(1) The maximum value of y is 1 3 + 3 2 = 2 6 + 9 6 = 11 6, and the minimum value is -1 3 + 3 2 = 9 6-2 6 = 7 6

2) The maximum value of y is 2-(-3)=5, and the minimum value is 2-3=-1