ÿÄêʮһÔ¸÷´óIT¹«Ë¾¶¼²»Ô¼¶øͬ¡¢Õùºó¿ÖºóµØµ½¸÷´ó¸ßУ½øÐÐÈ«¹úѲ»ØÕÐƸ¡£Óë´Ëͬʱ£¬ÍøÉÏÒ²¿ªÊ¼³öÏÖ´óÁ¿±ÊÊÔÃæÊÔÌ⣻ÍøÉÏÁ÷´«µÄÌâÄ¿ÍùÍù¶¼ºÜ¾«ÇÉ£¬¼ÈÄÜÈÿ¼²é»ù´¡ÖªÊ¶£¬ÓÖÔÚƽµ­ÖÐÒþº¬Á˹ãÀ«µÄÌìµØ¹©ÓÅÐãѧÉú³Û³Ò¡£

       ÕâÁ½ÌìÔÚÍøÉÏÌÔµ½Ò»µÀ±ÊÊÔÌâÄ¿£¨×¢1£©£¬ËäÈ»Õæ¼Ùδ֪£¬µ«µÄÈ·ÊǵÀºÃÌ⣬ÌâÄ¿ÈçÏ£º

       ´Ó10ÒÚ¸ö¸¡µãÊýÖÐÕÒ³ö×î´óµÄ1Íò¸ö¡£

ÕâÊÇÒ»µÀËÆÒ×ʵÄѵÄÌâÄ¿£¬Ò»°ãͬѧ×îÈÝÒ×ÖеÄÏÝÚå¾ÍÊÇûÓÐÖØÊÓÕâ¸ö¡°ÒÚ¡±×Ö¡£ÒòΪÓÐ10ÒÚ¸öµ¥¾«¶È¸¡µãÊýÔªËصÄÊý×éÔÚ32λƽ̨ÉÏÒѾ­´ïµ½3.7GBÖ®¾Þ£¬ÔÚ³£¼û¼ÆËã»úƽ̨£¨ÈçWin32£©ÉÏÉùÃ÷Ò»¸öÕâÑùµÄÊý×齫µ¼Ö¶ÑÕ»Òç³ö¡£ÕýÈ·µÄ½â¾ö·½·¨ÊÇ·ÖÖ稣¬±ÈÈçÿ´Î´¦Àí100Íò¸öÊý£¬È»ºóÔÙ×ÛºÏÆðÀ´¡£²»¹ýÕâ²»ÊDZ¾ÎÄÒªÌÖÂÛµÄÖ÷Ö¼£¬ËùÒÔ±¾ÎÄ°ÑÉÏÌâµÄ10ÒÚ¸ÄΪ1ÒÚ£¬°Ñ¸¡µãÊý¸ÄΪÕûÊý£¬ÕâÑù¿ÉÒÔÖ±½ÓµØÍê³ÉÕâ¸öÎÊÌ⣬ÓÐÀûÓÚÇåÎúµØÌÖÂÛÏà¹ØËã·¨µÄÓÅ»¯£¨×¢2£©¡£

²»¼Ù˼Ë÷

       Äõ½ÕâµÀÌ⣬ÂíÉϾͻáÏëµ½µÄ·½·¨Êǽ¨Á¢Ò»¸öÊý×é°Ñ1ÒÚ¸öÊý×°ÆðÀ´£¬È»ºóÓÃforÑ­»·±éÀúÕâ¸öÊý×飬ÕÒ³ö×î´óµÄ1Íò¸öÊýÀ´¡£Ô­ÒòºÜ¼òµ¥£¬ÒòΪÈç¹ûÒªÕÒ³ö×î´óµÄÄǸöÊý£¬¾ÍÊÇÕâÑù½â¾öµÄ£»¶øÕÒ×î´óµÄ1Íò¸öÊý£¬Ö»ÊÇÖظ´1Íò±é¶øÒÑ¡£

template< class T >

void solution_1( T BigArr[], T ResArr[] )

{

       for( int i = 0; i < RES_ARR_SIZE; ++i )

       {

              int idx = i;

              for( int j = i+1; j < BIG_ARR_SIZE; ++j )

              {

                     if( BigArr[j] > BigArr[idx] )

                            idx = j;

              }

              ResArr[i] = BigArr[idx];

              std::swap( BigArr[idx], BigArr[i] );

       }

}

ÉèBIG_ARR_SIZE £½ 1ÒÚ£¬RES_ARR_SIZE = 1Íò£¬ÔËÐÐÒÔÉÏËã·¨ÒѾ­³¬¹ý40·ÖÖÓ£¨×¢3£©£¬Ô¶Ô¶³¬¹ýÎÒÃǵĿɽÓÊÜ·¶Î§¡£

ÉÔ×÷˼¿¼

´ÓÉÏÃæµÄ´úÂë¿ÉÒÔ¿´³ö¸úSelectSortËã·¨µÄºËÐÄ´úÂëÊÇÒ»ÑùµÄ¡£ÒòΪSelectSortÊÇÒ»¸öO(n^2)µÄËã·¨£¨solution_1µÄʱ¼ä¸´ÔÓ¶ÈΪO(n*m)£¬ÒòΪsolution_1ûÓн«Õû¸ö´óÊý×éÈ«²¿ÅÅÐò£©£¬¶øÎÒÃÇÓÖÖªµÀÅÅÐòËã·¨¿ÉÒÔÓÅ»¯µ½O(nlogn)£¬ÄÇÃÇÊÇ·ñ¿ÉÒÔ´ÓÕâ·½ÃæÈëÊÖʹÓøü¿ìµÄÅÅÐòËã·¨ÈçMergeSor¡¢QuickSortÄØ£¿µ«ÕâЩËã·¨¶¼²»¾ß±¸´Ó´óÖÁСѡÔñ×î´óµÄN¸öÊýµÄ¹¦ÄÜ£¬Òò´ËÖ»Óн«1ÒÚ¸öÊý°´´Ó´óµ½Ð¡ÓÃQuickSortÅÅÐò£¬È»ºóÌáÈ¡×îÇ°ÃæµÄ1Íò¸ö¡£

template< class T, class I >

void solution_2( T BigArr[], T ResArr[] )

{

       std::sort( BigArr, BigArr + BIG_ARR_SIZE, std::greater_equal() );

       memcpy( ResArr, BigArr, sizeof(T) * RES_ARR_SIZE );

}

ÒòΪSTLÀïµÄsortË㷨ʹÓõÄÊÇQuickSort£¬ÔÚÕâÀïÖ±½ÓÄÃÀ´ÓÃÁË£¬ÊÇÒòΪ²»Ïëдһ¸öдһ¸öÖÚÈ˽ÔÖªµÄQuickSort´úÂëÀ´Õ¼Æª·ù£¨¶øÇÒSTLµÄsort¸ß¶ÈÓÅ»¯¡¢Ëٶȿ죩¡£

       ¶Ôsolution_2½øÐвâÊÔ£¬ÔËÐÐʱ¼äÊÇ32Ã룬ԼΪsolution_1µÄ1.5%µÄʱ¼ä£¬ÒѾ­È¡µÃÁ˼¸ºÎÊýÁ¿¼¶µÄ½øÕ¹¡£

ÉîÈë˼¿¼

       ѹÒÖסÐË·Ü»ØÍ·ÔÙ×Ðϸ¿´¿´solution_2£¬Ä㽫·¢ÏÖÒ»¸ö´óÎÊÌ⣬ÄǾÍÊÇÔÚsolution_2ÀïËùÓеÄÔªËض¼ÅÅÐòÁË£¡¶øÊÂʵÉÏÖ»ÐèÕÒ³ö×î´óµÄ1Íò¸ö¼´¿É£¬ÎÒÃDz»ÊÇ×öÁ˺ܶàÎÞÓù¦Âð£¿Ó¦¸ÃÔõôÑùÀ´Ïû³ýÕâЩÎÞÓù¦£¿

       Èç¹ûÄãһʱûÓÐÍ·Ð÷£¬ÄǾÍÈÃÎÒÂýÂýÒýµ¼Äã¡£Ê×ÏÈ£¬·¢¾òÒ»¸öÊÂʵ£ºÈç¹ûÕâ¸ö´óÊý×é±¾ÉíÒѾ­°´´Ó´óµ½Ð¡ÓÐÐò£¬ÄÇôÊý×éµÄÇ°1Íò¸öÔªËؾÍÊǽá¹û£»È»ºó£¬¿ÉÒÔ¼ÙÉèÕâ¸ö´óÊý×éÒѾ­´Ó´óµ½Ð¡ÓÐÐò£¬²¢½«Ç°1Íò¸öÔªËطŵ½½á¹ûÊý×飻ÔٴΣ¬ÊÂʵÉÏÕâ½á¹ûÊý×éÀï·ÅµÄδ±ØÊÇ×î´óµÄÒ»Íò¸ö£¬Òò´ËÐèÒª½«Ç°1Íò¸öÊý×ÖºóÐøµÄÔªËظú½á¹ûÊý×éµÄ×îСµÄÔªËرȽϣ¬Èç¹ûËùÓкóÐøµÄÔªËض¼±È½á¹ûÊý×éµÄ×îСԪËØ»¹Ð¡£¬Äǽá¹ûÊý×é¾ÍÊÇÏëÒªµÄ½á¹û£¬Èç¹ûijһºóÐøµÄÔªËرȽá¹ûÊý×éµÄ×îСԪËØ´ó£¬ÄǾÍÓÃËüÌæ»»½á¹ûÊý×éÀï×îСµÄÊý×Ö£»×îºó£¬±éÀúÍê´óÊý×飬µÃµ½µÄ½á¹ûÊý×é¾ÍÊÇÏëÒªµÄ½á¹ûÁË¡£

template< class T >

void solution_3( T BigArr[], T ResArr[] )

{

       //È¡×îÇ°ÃæµÄÒ»Íò¸ö

       memcpy( ResArr, BigArr, sizeof(T) * RES_ARR_SIZE );

       //±ê¼ÇÊÇ·ñ·¢Éú¹ý½»»»

       bool bExchanged = true;

       //±éÀúºóÐøµÄÔªËØ

       for( int i = RES_ARR_SIZE; i < BIG_ARR_SIZE; ++i )

       {

              int idx;

              //Èç¹ûÉÏÒ»ÂÖ·¢Éú¹ý½»»»

              if( bExchanged )

              {

                     //ÕÒ³öResArrÖÐ×îСµÄÔªËØ

                     int j;

                     for( idx = 0, j = 1; j < RES_ARR_SIZE; ++j )

                     {

                            if( ResArr[idx] > ResArr[j] )

                                   idx = j;

                     }

              }

              //Õâ¸öºóÐøÔªËرÈResArrÖÐ×îСµÄÔªËØ´ó£¬ÔòÌæ»»¡£

              if( BigArr[i] > ResArr[idx] )

              {

                     bExchanged = true;

                     ResArr[idx] = BigArr[i];

              }

              else

                     bExchanged = false;

       }

}

       ÉÏÃæµÄ´úÂëʹÓÃÁËÒ»¸ö²¼¶û±äÁ¿bExchanged±ê¼ÇÊÇ·ñ·¢Éú¹ý½»»»£¬ÕâÊÇÒ»¸öÇ°ÎÄûÓÐ̸µ½µÄÓÅ»¯ÊֶΡª¡ªÓÃÒÔ±ê¼ÇÔªËؽ»»»µÄ״̬£¬¿ÉÒÔ´ó´ó¼õÉÙ²éÕÒResArrÖÐ×îСԪËصĴÎÊý¡£Ò²¶Ôsolution_3½øÐвâÊÔһϣ¬½á¹ûÓÃʱ2.0Ãë×óÓÒ£¨²»Ê¹ÓÃbExchangedÔò¸ß´ï32·ÖÖÓ£©£¬Ô¶Ð¡ÓÚsolution_2µÄÓÃʱ¡£

Éî˼ÊìÂÇ

       ÔÚ½øÈëÏÂÒ»²½ÓÅ»¯Ö®Ç°£¬·ÖÎöÒ»ÏÂsolution_3µÄ³É¹¦Ö®´¦¡£µÚÒ»¡¢solution_3µÄËã·¨Ö»±éÀú´óÊý×éÒ»´Î£¬¼´ËüÊÇÒ»¸öO(n)µÄËã·¨£¬¶øsolution_1ÊÇO(n*m)µÄËã·¨£¬solution_2ÊÇO(nlogn)µÄËã·¨£¬¿É¼ûËüÔÚ±¾ÖÊÉÏÓÐ×ÅÌìÈ»µÄÓÅÔ½ÐÔ£»µÚ¶þ¡¢ÔÚsolution_3ÖÐÒýÈëÁËbExchangedÕâÒ»±êÖ¾±äÁ¿£¬´Ó²âÊÔÊý¾Ý¿É¼ûÒýÈëbExchanged¼õÉÙÁËÔ¼99.99%µÄʱ¼ä£¬ÕâÊÇÒ»¸ö·Ç³£´óµÄ³É¹¦¡£

       ÉÏÃæÕâ¶Î»°¾ø·Ç½ö½ö˵Ã÷ÁËsolution_3µÄÓŵ㣬¸üÖØÒªµÄÊÇ°Ñsolution_3µÄÖ÷Ҫì¶Ü°ÚÉÏÁË×ÀÃ桪¡ªÎªÊ²Ã´Ò»¸öO(n)µÄË㷨ЧÂÊ»á¸úO(n*m)µÄËã·¨²î²»¶à£¨²»Ê¹ÓÃbExchanged£©£¿ÎªÊ²Ã´Ê¹ÓÃÁËbExchangedÄܹ»¼õÉÙ99.99%µÄʱ¼ä£¿´ø×ÅÕâÁ½¸öÎÊÌâÔÙ´ÎÉóÊÓsolution_3µÄ´úÂ룬·¢ÏÖbExchangedµÄÒýÈëʵ¼ÊÉϼõÉÙÁËÈçÏ´úÂë¶ÎµÄÖ´ÐдÎÊý£º

for( idx = 0, j = 1; j < RES_ARR_SIZE; ++j )

{

       if( ResArr[idx] > ResArr[j] )

              idx = j;

}

ÉÏÃæµÄ´úÂë¶Î¼´ÊDzéÕÒResArrÖÐ×îСԪËصÄËã·¨£¬·ÖÎöËü¿ÉÖªÕâÊÇÒ»¸öO(n)µÄËã·¨£¬µ½´Ëʱ¾ÍË®Âäʯ³öÁË£¡Ô­À´ËäÈ»solution_3ÊÇÒ»¸öO(n)µÄËã·¨£¬µ«ÒòΪÄÚ²¿Ê¹ÓõIJéÕÒ×îСԪËصÄËã·¨Ò²ÊÇO(n)µÄËã·¨£¬ËùÒÔ¾ÍÍË»¯ÎªO(n*m)µÄËã·¨ÁË¡£Äѹֲ»Ê¹ÓÃbExchangedʹÓõÄʱ¼ä¸úsolution_1²î²»¶à£»ÕâÒ²´Ó·´ÃæÖ¤Ã÷ÁËsolution_3±»ÉÏÃæµÄÕâÒ»´úÂë¶Îµ¼ÖÂÐÔÄÜÍË»¯¡£Ê¹ÓÃÁËbExchangedÖ®ºóÒòΪ¼õÉÙÁ˺ܶà²éÕÒ×îСԪËصĴúÂë¶ÎÖ´ÐУ¬ËùÒÔÄܹ»½ÚÊ¡99.99%µÄʱ¼ä£¡

       ÖÁ´Ë¿ÉÖªÔªÐ×¾ÍÊDzéÕÒ×îСԪËصĴúÂë¶Î£¬µ«²éÕÒ×îСԪËØÊDZز»¿ÉÉٵIJÙ×÷£¬ÔÚÕâ¸öÁ½ÄѵÄÇé¿öϸÃÔõôȥÓÅ»¯ÄØ£¿´ð°¸¾ÍÊDZ£³Ö½á¹ûÊý×飨¼´ResArr£©ÓÐÐò£¬ÄÇÑùµÄ»°×îСµÄÔªËØ×ÜÊÇ×îºóÒ»¸ö£¬´Ó¶øÊ¡È¥²éÕÒ×îСԪËصÄʱ¼ä£¬½â¾öÉÏÃæµÄÎÊÌâ¡£µ«ÕâÒ²ÒýÈëÁËÒ»¸öеÄÎÊÌ⣺±£³ÖÊý×éÓÐÐòµÄ²åÈëËã·¨µÄʱ¼ä¸´ÔÓ¶ÈÊÇO(n)µÄ£¬ËäÈ»ÔÚÕâ¸öÎÊÌâÀï²åÈëµÄÊý´Î±ÈÀý½ÏС£¬µ«ÒòΪ»ùÊýÌ«´ó£¨1ÒÚ£©£¬ÕâÒ»¿ªÏúÈÔÈ»»áÁî±¾·½°¸µÃ²»³¥Ê§¡£

       ÄѵÀ¾ÍûÓа취ÁËÂ𣿼ǵÃСѧ½âÓ¦ÓÃÌâʱÀÏʦ½Ìµ¼¹ýÎÒÃÇÈç¹û½âÌâûÓÐ˼·£¬ÄǾͶà¶Á¼¸±éÌâÄ¿¡£ÔÙ´ÎÉóÌ⣬עÒâµ½ÌâÄ¿²¢Ã»ÓÐÒªÇóÕÒµ½µÄ×î´óµÄ1Íò¸öÊýÒªÓÐÐò£¨×¢4£©£¬ÕâÒâζ×Å¿ÉÒÔͨ¹ýÈçÏÂËã·¨À´½â¾ö£º

1)        ½«BigArrµÄÇ°1Íò¸öÔªËظ´ÖƵ½ResArr²¢ÓÃQuickSortʹResArrÓÐÐò£¬²¢¶¨Òå±äÁ¿MinElemIdx±£´æ×îСԪËصÄË÷Òý£¬²¢¶¨Òå±äÁ¿ZoneBeginIdx±£´æ¿ÉÄÜ·¢Éú½»»»µÄÇøÓòµÄ×îСË÷Òý£»

2)        ±éÀúBigArrÆäËüµÄÔªËØ£¬Èç¹ûijһԪËرÈResArr×îСԪËØС£¬Ôò½«ResArrÖÐMinElemIdxÖ¸ÏòµÄÔªËØÌæ»»£¬Èç¹ûZoneBeginIdx == MinElemIdxÔòÀ©Õ¹ZoneBeginIdx£»

3)        ÖØÐÂÔÚZoneBeginIdxÖÁRES_ARR_SIZEÔªËضÎÖÐÑ°ÕÒ×îСԪËØ£¬²¢ÓÃMinElemIdx±£´æÆäËüË÷Òý£»

4)        Öظ´2)Ö±ÖÁ±éÀúÍêËùÓÐBigArrµÄÔªËØ¡£

ÒÀÉÏËã·¨£¬Ð´´úÂëÈçÏ£º

template< class T, class I >

void solution_4( T BigArr[], T ResArr[] )

{

       //È¡×îÇ°ÃæµÄÒ»Íò¸ö

       memcpy( ResArr, BigArr, sizeof(T) * RES_ARR_SIZE );

       //ÅÅÐò

       std::sort( ResArr, ResArr + RES_ARR_SIZE, std::greater_equal() );

       //×îСԪËØË÷Òý

       unsigned int MinElemIdx = RES_ARR_SIZE - 1;

       //¿ÉÄܲúÉú½»»»µÄÇøÓòµÄ×îСË÷Òý

       unsigned int ZoneBeginIdx = MinElemIdx;

       //±éÀúºóÐøµÄÔªËØ

       for( unsigned int i = RES_ARR_SIZE; i < BIG_ARR_SIZE; ++i )

       {    

              //Õâ¸öºóÐøÔªËرÈResArrÖÐ×îСµÄÔªËØ´ó£¬ÔòÌæ»»¡£

              if( BigArr[i] > ResArr[MinElemIdx] )

              {

                     ResArr[MinElemIdx] = BigArr[i];

                     if( MinElemIdx == ZoneBeginIdx )

                            --ZoneBeginIdx;

                     //²éÕÒ×îСԪËØ

                     unsigned int idx = ZoneBeginIdx;

                     unsigned int j = idx + 1;

                     for( ; j < RES_ARR_SIZE; ++j )

                     {

                            if( ResArr[idx] > ResArr[j] )

                                   idx = j;

                     }

                     MinElemIdx = idx;

              }

       }

}

       ¾­¹ý²âÊÔ£¬Í¬ÑùÇé¿öÏÂsolution_4ÓÃʱԼ1.8Ã룬½Ïsolution_3ЧÂÊÂԸߣ¬×ÜËã²»¸ºÒ»·¬Å¬Á¦¡£