I have defined an array of structs and initialized the data, how do I find the maximum value?

Your mistake is that each loop pair is compared to m, which is just the value of the first element in the array. That is, as long as the element in the array is larger than the first element, this value will be assigned to e. So you get the last value in the array that is greater than m.

For example, if the number in the array is 72, 70, 80, 75, 88, 62, 77, then your program will get 77

Your program can be changed like this:

int i;

int m=stu[0].sx;

int e;

for(i=1;i<=10;i++)

if(stu[i].sx>m)

m=stu[i].sx;Replace e with m

elseprintf("The highest score in math is: %d",e);

There is no need to use the e variable.

int i;

int m=stu[0].sx;

for(i=1;i<=10;i++)

if(stu[i].sx>m)

m=stu[i].sx;

printf("The highest score in math is: %d",m);

As long as the data is initialized correctly, the correct results are likely to be obtained.

That's fine, int i;

int m=stu[0].sx;

int e;

for(i=1;i<=10;i++)

if(stu[i].sx>m)

m=stu[i].sx;Modifications. elsem=m;Modify the place, of course you can cancel the **.

e=m;Modifications.

printf("The highest score in math is: %d",e);

stu[0].What is stored by SX.

That e doesn't seem to be useful, just use m to store the maximum value.

A Huffman tree is given n weights as n leaf nodes to construct a binary tree, and if the length of the weighted path of the tree reaches the minimum, such a binary tree is called the optimal binary tree, also known as the Huffman tree. The Huffman tree is the tree with the shortest weighted path length, and the nodes with larger weights are closer to the roots.

Example: 1. 、... w1 and w2, wn is seen as a forest with n trees (each tree has only one node);

2. The tree with the smallest weight of two root nodes is selected and merged in the forest as the left and right subtrees of a new tree, and the root node weights of the new tree are the sum of the weights of the root nodes of the left and right subtrees;

3. Delete the two selected trees from the forest and add new trees to the forest;

4. Repeat steps (2) and (3) until there is only one tree left in the forest, which is the Huffman tree that you have sought.