單鏈表的折半查找，冒泡排序，選擇排序-創(chuàng)新互聯(lián)

//選擇排序

創(chuàng)新互聯(lián)10多年成都定制網(wǎng)頁(yè)設(shè)計(jì)服務(wù);為您提供網(wǎng)站建設(shè),網(wǎng)站制作,網(wǎng)頁(yè)設(shè)計(jì)及高端網(wǎng)站定制服務(wù),成都定制網(wǎng)頁(yè)設(shè)計(jì)及推廣,對(duì)不銹鋼雕塑等多個(gè)行業(yè)擁有多年的網(wǎng)站推廣經(jīng)驗(yàn)的網(wǎng)站建設(shè)公司。

void SelectSort(SeqList* pSeqList)

{

                int i = 0, j = 0;

                int iMaxPos = 0;

                int iMinPos = 0;

                DataType temp;

for (; i < pSeqList->Size/2; ++i)

  {

     iMaxPos = i;

     iMinPos = i;

    for(j = 1; j < pSeqList->Size - i; j++)

      {

      if (pSeqList->arry[iMaxPos] < pSeqList->arry[j])

           {

                 iMaxPos = j;

           }

      if (pSeqList->arry[iMinPos] > pSeqList->arry[j])

           {

               iMinPos = j;

            }

      }

    if (iMaxPos != i)

     {

          temp = pSeqList->arry[iMaxPos];

        pSeqList->arry[iMaxPos] = pSeqList->arry[pSeqList->Size - i - 1];

        pSeqList->arry[pSeqList->Size - i - 1] = temp;

      }

     if (iMinPos != i)

     {

         temp = pSeqList->arry[iMinPos];

          pSeqList->arry[iMinPos] = pSeqList->arry[i];

          pSeqList->arry[i] = temp;

      }

  }

}

//冒泡排序

void BorbbleSort(SeqList* pSeqList)

{

                int iCount = 0;

                int iBegin = 0;

                int iFlag = 0;

                if (NULL == pSeqList)

                {

                                return;

                }

    for (; iCount <pSeqList->Size - 1; iCount++)

    {

        iFlag = 1;

        for (iBegin = 0; iBegin < pSeqList->Size - iCount - 1; ++iBegin)

        {

          if (pSeqList->arry[iBegin] > pSeqList->arry[iBegin+1])

           {

                DataType temp = pSeqList->arry[iBegin];

                pSeqList->arry[iBegin] = pSeqList->arry[iBegin+1];

                pSeqList->arry[iBegin+1] = temp;

                 iFlag = 0;

            }

          }

          if (iFlag)

          {

             return;

          }

     }

}

// 折半查找

int BinarySearch(SeqList* pSeqList, DataType data)

{

                int iLeft = 0;

                int iRight = pSeqList->Size;// [)

                //int iMid = (iLeft + iRight)/2;

                int iMid = 0;

                DataType temp;

                if (NULL == pSeqList)

                {

                                return;

                }

                // [0, 4]

                while(iLeft < iRight)

                {

                                iMid = iLeft + (iRight - iLeft)/2;

                                temp = pSeqList->arry[iMid];

                                if (temp < data)

                                {

                                                iLeft = iMid;

                                }

                                else if (temp > data)

                                {

                                                iRight = iMid - 1;

                                }

                                else

                                {

                                                return iMid;

                                }

                }

                return -1;

}

另外有需要云服務(wù)器可以了解下創(chuàng)新互聯(lián)scvps.cn，海內(nèi)外云服務(wù)器15元起步，三天無(wú)理由+7*72小時(shí)售后在線，公司持有idc許可證，提供“云服務(wù)器、裸金屬服務(wù)器、高防服務(wù)器、香港服務(wù)器、美國(guó)服務(wù)器、虛擬主機(jī)、免備案服務(wù)器”等云主機(jī)租用服務(wù)以及企業(yè)上云的綜合解決方案，具有“安全穩(wěn)定、簡(jiǎn)單易用、服務(wù)可用性高、性價(jià)比高”等特點(diǎn)與優(yōu)勢(shì)，專為企業(yè)上云打造定制，能夠滿足用戶豐富、多元化的應(yīng)用場(chǎng)景需求。

網(wǎng)頁(yè)題目：單鏈表的折半查找，冒泡排序，選擇排序-創(chuàng)新互聯(lián)
鏈接URL：http://www.muchs.cn/article2/epooc.html

成都網(wǎng)站建設(shè)公司_創(chuàng)新互聯(lián)，為您提供網(wǎng)站維護(hù)、虛擬主機(jī)、網(wǎng)站制作、ChatGPT、全網(wǎng)營(yíng)銷推廣、用戶體驗(yàn)

廣告

聲明：本網(wǎng)站發(fā)布的內(nèi)容（圖片、視頻和文字）以用戶投稿、用戶轉(zhuǎn)載內(nèi)容為主，如果涉及侵權(quán)請(qǐng)盡快告知，我們將會(huì)在第一時(shí)間刪除。文章觀點(diǎn)不代表本網(wǎng)站立場(chǎng)，如需處理請(qǐng)聯(lián)系客服。電話：028-86922220；郵箱：631063699@qq.com。內(nèi)容未經(jīng)允許不得轉(zhuǎn)載，或轉(zhuǎn)載時(shí)需注明來(lái)源： 創(chuàng)新互聯(lián)