|
Use this algorithm,
If your array name is a() then :-
Sub Sort
For i = lbound(a) to ubound(a)-1
For m = lbound(a) to ubound(a)-1
if a(m)>a(m+1) then
t=a(m+1)
a(m+1) = a(m)
a(m) = t
end if
next
next
open "c:\sorted.txt" for binary as #1
put #1,,a
close #1
end sub
# Now your array is sorted and writen. But this sorting is Bubble Sort and a bit time consuming
|
__________________
Hasin Hayder
http://www.vbsthopoti.cjb.net
Lead Programmer - EvelinDev
Things that are tough takes time - Things that are impossible takes a little more.
|