请教数组排列简单算法

jsbiz 2005-02-21 09:35:11

请教数组排列简单算法
有数组
a1="1,14,25,37,48,55"
和
a2="2,5,3,40,30,60,50"
要求将a2的数字按照大小插入a1中得到如下：
a3="1,2,3,5,14,25,30,37,40,48,50,55,60"
请问简单的写法。谢谢。
WEB应用中

...全文

87 4 打赏收藏转发到动态举报

写回复

用AI写文章

4 条回复

切换为时间正序

请发表友善的回复…

发表回复

iuhxq 2005-02-22

打赏
举报

js里有sort函数

scoutlin 2005-02-22

打赏
举报

上面写得多了一点
<script language=vbscript>
a1="1,14,25,37,48,55"
a2="2,5,3,40,30,60,50"
a=a1&","&a2
a=split(a,",")
a=sortArray(a)
a3=join(a,",")
msgbox a3
function sortArray(arr)
for k=0 to ubound(arr)-1
for l=k+1 to ubound(arr)
if cint(arr(k))>cint(arr(l)) then
tmp=arr(k)
arr(k)=arr(l)
arr(l)=tmp
end if
next
next
sortArray=arr
end function
</script>

scoutlin 2005-02-22

打赏
举报

冒泡应该够简单了
<script language=vbscript>
a1="1,14,25,37,48,55"
a2="2,5,3,40,30,60,50"
a=split(a1,",")
b=split(a2,",")
maxa=ubound(a)
redim preserve a(maxa+ubound(b)+1)
for i=maxa+1 to ubound(a)
a(i)=b(i-maxa-1)
next
a=sortArray(a)
a3=join(a,",")
msgbox a3
function sortArray(arr)
for k=0 to ubound(arr)-1
for l=k+1 to ubound(arr)
if cint(arr(k))>cint(arr(l)) then
tmp=arr(k)
arr(k)=arr(l)
arr(l)=tmp
end if
next
next
sortArray=arr
end function
</script>

jsbiz 2005-02-22