A string of data is sorted from smallest to largest

If the program in Tsing Yi upstairs could work, this sentence that generates random numbers may need to rule out the possibility of producing the same number. It doesn't matter if the same value is allowed.

for(i=0;i<20;i++)

a[i] = rand()%100;

As follows:

1. First of all, enter the number of different numbers in **.

2. Then enter the formula to sort these functions, 1 represents ascending and 0 represents descending.

3. Enter the formula =,a2:a12,1).

4. Press the Enter key.

Later, the first number will be sorted by the spike shed.

5. Pull down the formula and you will find that the sorting is not quite correct.

6. You can publicize it.

Add the absolute value symbol to it, and then enter the Zheng Shanxing pull-down to sort it correctly.

N inputs at will, arranged in order from smallest to largest, and the outputs are displayed. (Sorting algorithm - selection method sorting).

Hello and thank you for your question! According to your requirements, we need to use the selection sorting algorithm to sort any n numbers from smallest to largest and display the output. The advantage of the selection sort algorithm is that it only needs to access the array once at a time, no extra space is required, and the efficiency is also very high, and the number of comparisons of the algorithm has nothing to do with the number of elements n, but only with the initial state of the elements before sorting, that is, if the data is basically ordered before sorting, then it will be fast.

The principle of the algorithm is to select the largest (or smallest) number in the corresponding position from smallest to largest. The algorithm process is as follows: Outer loop:

From 0 to n-1, cycle n times; Inner Loop: Find the minimum value from I+1 and save the position; Swap the minimum value with the value of the i position; Repeat the inner loop until the comparison reaches the end; Repeat the outer loop until the sorting is complete. Hope these can help you solve the problem, I wish you a speedy solution to the problem, and I wish you a happy life!

Idea: Compare the value of the first element in the array with the value of all the elements that follow it, and swap it if the former is greater than the latter, so that the smallest value of all elements is placed in the first element. And so on until the last element.

Then the specific ** is shown as follows:

#include

define n 5 * for 5 numbers in ascending order main().

The specific operation results are as follows:

The algorithm in C enters n (the size of the problem) and then the number of n includevoid main().

for(i=0;iprintf("%d ",a[i]);Output the sequence)}

Arrange a set of data from largest to smallest or from smallest to largest, and the middle number is called the median of this set of data, so the answer is: median