int[] Array = new int[132]{//132
115,105,106,107,108,109,110,111,112,113,114,
215,205,206,207,208,209,210,211,212,213,214,
315,305,306,307,308,309,310,311,312,313,314,
415,405,406,407,408,409,410,411,412,413,414,
115,105,106,107,108,109,110,111,112,113,114,
215,205,206,207,208,209,210,211,212,213,214,
315,305,306,307,308,309,310,311,312,313,314,
415,405,406,407,408,409,410,411,412,413,414,
115,105,106,107,108,109,110,111,112,113,114,
215,205,206,207,208,209,210,211,212,213,214,
315,305,306,307,308,309,310,311,312,313,314,
415,405,406,407,408,409,410,411,412,413,414
};
public int mxnum;
public int finnum;
void Start ()
{
for (int i = 0; i < array. Length; i++)
{
for (int j = i+1; J < Array. Length; J + +)
{
if (array[j]%100 > Array[i]%100)
{
Mxnum = Array[j];
ARRAY[J] = Array[i];
Array[i] = Mxnum;
}
If (array[j]% = = Array[i]% 100)
{
if (Array[j] > Array[i])
{
Finnum = Array[j];
ARRAY[J] = Array[i];
Array[i] = Finnum;
}
}
}
}
for (int i = 0; i < array. Length; i++)
{
Print ("---" + array[i]);
}
}
A special sorting algorithm for chess and board games