How do you enter the 5 numbers? This is the most import part because finding the largest one is too easy to mention.

This looks like a school assignment and the numbers are to be entered using the Irvine library.

it is school assignment , user enter 5 nomber ( in array maybe ) and the programme find the max of the nombers

This can't be "may be", it is the most important part.Once you have the five numbers it is uncomplicated to sort them.

You can do a Bubble Sort, for instance. Just in case you don't know what was that, I searched the wikipedia for you:

"The algorithm starts at the beginning of the data set. It compares the first two elements, and if the first is greater than the second, it swaps them. It continues doing this for each pair of adjacent elements to the end of the data set. It then starts again with the first two elements, repeating until no swaps have occurred on the last pass. This algorithm's average time and worst-case performance is O(n2), so it is rarely used to sort large, unordered data sets. Bubble sort can be used to sort a small number of items (where its asymptotic inefficiency is not a high penalty). "

PS: I read again what you want, the maximum, so you don't even need to sort the array.

Of course, if you don't have the slightest idea of the x86 instruction set it might be a nightmare. You have my sympathy if this is the case.