冒泡排序

最新推荐文章于 2025-04-12 16:15:34 发布

suscom

最新推荐文章于 2025-04-12 16:15:34 发布

阅读量1.1k

点赞数

分类专栏：算法设计文章标签： string function asp.net asp c#

本文链接：https://blog.youkuaiyun.com/suscom/article/details/317217

版权

算法设计专栏收录该内容

2 篇文章

订阅专栏

[ASP代码]

'===========================================================
'该函数实现冒泡排序，如输入:"5,4,3,2,1",输出"1,2,3,4,5"
'===========================================================
function sortFun(sortNum)
    arrSort=split(sortNum,",")
dim tempNum
loopNum=UBound(arrSort)
do while(loopNum>0)
     for i=LBound(arrSort) to loopNum
          if i<>loopNum then
              if int(arrSort(i))>int(arrSort(i+1)) then
                tempNum=int(arrSort(i))
             arrSort(i)=int(arrSort(i+1))
             arrSort(i+1)=tempNum
           end if
          end if
     next
  loopNum=loopNum-1
loop
dim retNum
for i=LBound(arrSort) to UBound(arrSort)
      retNum=retNum&arrSort(i)&","
next
sortFun=left(retNum,len(retNum)-1)
end function

[ASP.NET(C#)]

//===========================================================
  //该函数实现冒泡排序，如输入:"5,4,3,2,1",输出"1,2,3,4,5"
  //===========================================================
  private string SortFun(string strNum)
  {
   //char[] sep={','};
   string[] ArrNum=strNum.Split(',');
   int lenArr=ArrNum.Length;
   for(int j=0;j<lenArr;j++){
    string temp="";
    for(int i=0;i<lenArr;i++)
    {
     if(i<lenArr-1)
     {
      if(Int32.Parse(ArrNum[i])>Int32.Parse(ArrNum[i+1]))
      {
       temp=ArrNum[i];
       ArrNum[i]=ArrNum[i+1];
       ArrNum[i+1]=temp;
      }
     }
    }
    //lenArr--;
   }
   string retStr="";
   for(int i=0;i<lenArr;i++){
   retStr=retStr+ArrNum[i]+",";
   }
   retStr=retStr.Substring(0,retStr.Length-1);
   return retStr;
  }