stock FraktionRanking()
{
    new array[] = {0, 0, 0, 0, 0, 0}, index = 0, rearray[] = {0, 0, 0, 0, 0, 0}, reindex = 0;
    for(new i = 0; i < sizeof(GangRankingInfo); ++i)
    {
        if(GangRankingInfo[i][gRank] != 0)
        {
            array[index] = GangRankingInfo[i][gKillDiff];
            index++;
        }
    }
    quickSort(array, 0, sizeof(array)-1);
	for(new n = 0; n < 6; ++n)
    {
        for(new i = 0; i < sizeof(GangRankingInfo); ++i)
        {
	        if(GangRankingInfo[i][gKillDiff] == array[n])
			{
	   			rearray[reindex] = i;
	   			reindex ++;
	        }
        }
        if(rearray[1] == 0)
		{
			GangRankingInfo[rearray[0]][gRank] = 6-n;
		}
		else if(rearray[1] >= 1 && rearray[2] == 0)
		{
		    GangRankingInfo[rearray[0]][gRank] = 6-n;
		    GangRankingInfo[rearray[1]][gRank] = 6-n-1;
		}
		else if(rearray[2] >= 1 && rearray[3] == 0)
		{
		    GangRankingInfo[rearray[0]][gRank] = 6-n;
		    GangRankingInfo[rearray[1]][gRank] = 6-n-1;
		    GangRankingInfo[rearray[2]][gRank] = 6-n-2;
		}
		else if(rearray[3] >= 1 && rearray[4] == 0)
		{
		    GangRankingInfo[rearray[0]][gRank] = 6-n;
		    GangRankingInfo[rearray[1]][gRank] = 6-n-1;
		    GangRankingInfo[rearray[2]][gRank] = 6-n-2;
		    GangRankingInfo[rearray[3]][gRank] = 6-n-3;
		}
		else if(rearray[4] >= 1 && rearray[5] == 0)
		{
		    GangRankingInfo[rearray[0]][gRank] = 6-n;
		    GangRankingInfo[rearray[1]][gRank] = 6-n-1;
		    GangRankingInfo[rearray[2]][gRank] = 6-n-2;
		    GangRankingInfo[rearray[3]][gRank] = 6-n-3;
		    GangRankingInfo[rearray[4]][gRank] = 6-n-4;
		}
		else if(rearray[5] >= 1)
		{
		    GangRankingInfo[rearray[0]][gRank] = 6-n;
		    GangRankingInfo[rearray[1]][gRank] = 6-n-1;
		    GangRankingInfo[rearray[2]][gRank] = 6-n-2;
		    GangRankingInfo[rearray[3]][gRank] = 6-n-3;
		    GangRankingInfo[rearray[4]][gRank] = 6-n-4;
		    GangRankingInfo[rearray[4]][gRank] = 6-n-5;
		}
        reindex = 0;
    }
    return 1;
}