<div>
Did you mean:<br />
&nbsp; &nbsp; &nbsp;Example T = (1, 30, 2, 1, 15, 6, 15) &nbsp;==&gt; &nbsp;C = (6 ,1 ,5 ,6 ,2 ,4 , 2)<br />
<br />
If so, then you just have to sort &nbsp; &nbsp;( 1, T[1]), (2, T[2], &nbsp;... (n, T[n]) &nbsp; &nbsp;max to min by the second element and output the first element in new order resolving ties.
</div>


Did you mean:
     Example T = (1, 30, 2, 1, 15, 6, 15)  ==>  C = (6 ,1 ,5 ,6 ,2 ,4 , 2)

If so, then you just have to sort    ( 1, T[1]), (2, T[2],  ... (n, T[n])    max to min by the second element and output the first element in new order resolving ties.

<div>
Well, problem raises when several scores are identical ...<br />
In my example (you corrected it, thanks), score 15 is twice the second
</div>


Well, problem raises when several scores are identical ...
In my example (you corrected it, thanks), score 15 is twice the second

<div>
<div class="content wysiwyg-content">
I have a array T[1..N] of integer (Delphi XE2)<br />
It contains the scores obtained by players (player 1 =&gt; T[1], etc...)<br />
I need to have the final classification of them in array C[1..N] of integer;<br />
So if player p has the highest score, C[p] value is 1 (first) etc...<br />
In case of several same score, then same classification <br />
Exampe T = (1,30,2,1,15,6,15)<br />
C = (5,1,5,2,4,2)<br />
What is the &quot;best&quot; code to achieve this ?
</div>
</div>


I have a array T[1..N] of integer (Delphi XE2)
It contains the scores obtained by players (player 1 => T[1], etc...)
I need to have the final classification of them in array C[1..N] of integer;
So if player p has the highest score, C[p] value is 1 (first) etc...
In case of several same score, then same classification 
Exampe T = (1,30,2,1,15,6,15)
C = (5,1,5,2,4,2)
What is the "best" code to achieve this ?

Algorithm for the classification of scores

An algorithm is a self-contained step-by-step set of operations to be performed. Algorithms exist that perform calculation, data processing, and automated reasoning. Starting from an initial state and initial input (perhaps empty), the instructions describe a computation that, when executed, proceeds through a finite number of well-defined successive states, eventually producing "output" and terminating at a final ending state. The transition from one state to the next is not necessarily deterministic; some algorithms, known as randomized algorithms, incorporate random input.

Algorithms

Delphi is the most powerful Object Pascal IDE and component library for cross-platform Native App Development with flexible Cloud services and broad IoT connectivity. It provides powerful VCL controls for Windows 10 and enables FMX development for Windows, Mac and Mobile. Delphi is your choice for ultrafast Enterprise Strong Development™. Look for increased memory for large projects, extended multi-monitor support, improved Object Inspector and much more. Delphi is 5x faster for development and deployment across multiple desktop, mobile, cloud and database platforms including 32-bit and 64-bit Windows 10.