Torque2D MIT 学习笔记(25) ---- 记录

// 卡片排序(冒泡算法)
function SortCards( %cards )
{
    %changed = true;
    while( %changed )
    {
        %changed = false;
        for( %index = 0; %index < getWordCount( %cards ) - 1; %index++ )
        {
            %card = getWord( %cards, %index );
            %cardNext = getWord( %cards, %index + 1 );
             
            %ret = EqualCards( %card, %cardNext );
            if( %ret == 1 )
            {
                %cards = setWord( %cards, %index, %cardNext );
                %cards = setWord( %cards, %index+1, %card );
                %changed = true;
            }
        }
    }
 
    return %cards;
}

 

转载于:https://www.cnblogs.com/KevinYuen/archive/2013/04/06/3002010.html