中国DOS联盟

@echo off&setlocal enabledelayedexpansion

set "str=56 12 33 48 99 105 5 16"

for %%i in (%str%) do call,set var=!var! n%%in

for %%i in (%var%) do set a=%%i&call :lp

echo !var:n=!

pause>nul&goto :eof

:lp

for %%i in (%var%) do (

    set b=%%i&set b=!b:~1,-1!&set c=%a:~1,-1%

    if !b! lss !c! (

       set var=!var:%a% =!

       set var=!var:%%i=%%i %a%!

       ) else (

       set var=!var!

   )

)

@echo off&setlocal enabledelayedexpansion

set "str=%random% %random% -%random% %random% %random% %random% -%random%"

for %%i in (%str%) do call,set var=!var! n%%in

for %%i in (%var%) do set a=%%i&call :lp

echo !var:n=!

pause>nul&goto :eof

:lp

for %%i in (%var%) do (

    set b=%%i&set b=!b:~1,-1!&set c=%a:~1,-1%

    if !b! lss !c! (

       set var=!var:%a% =!

       set var=!var:%%i=%%i %a%!

       ) else (

       set var=!var!

   )   

)

If there is a column of values such as: 56 12 33 48 99 105 5 16
How to output it as: 5 12 16 33 48 56 99 105 through batch processing, and no temporary files are to be generated.
----------------------------------------------------------------------------------------------------------
Overall, my general code is as follows:

@echo off&setlocal enabledelayedexpansion

set "str=56 12 33 48 99 105 5 16"

for %%i in (%str%) do call,set var=!var! n%%in

for %%i in (%var%) do set a=%%i&call :lp

echo !var:n=!

pause>nul&goto :eof

:lp

for %%i in (%var%) do (

    set b=%%i&set b=!b:~1,-1!&set c=%a:~1,-1%

    if !b! lss !c! (

       set var=!var:%a% =!

       set var=!var:%%i=%%i %a%!

       ) else (

       set var=!var!

   )

)

Further expansion:

@echo off&setlocal enabledelayedexpansion

set "str=%random% %random% -%random% %random% %random% %random% -%random%"

for %%i in (%str%) do call,set var=!var! n%%in

for %%i in (%var%) do set a=%%i&call :lp

echo !var:n=!

pause>nul&goto :eof

:lp

for %%i in (%var%) do (

    set b=%%i&set b=!b:~1,-1!&set c=%a:~1,-1%

    if !b! lss !c! (

       set var=!var:%a% =!

       set var=!var:%%i=%%i %a%!

       ) else (

       set var=!var!

   )   

)

Last edited by zw19750516 on 2008-5-4 at 09:20 PM ]

Arrange them in order from small to large.

If it's purely P, I usually first compare the lengths, and if the lengths are the same, then compare the values.

Linux

$ cat TEST
56
12
33
48
99
105
5
16

$ sort -n <TEST
5
12
16
33
48
56
99
105

The moderator also comes to join in the fun...

cmd is not as powerful as shell.

There is still no perfect answer so far!

@echo off&setlocal enabledelayedexpansion
set/p str=Enter a number (separated by spaces)
for %%i in (%str%) do (
set str=0000000000%%i
set .!str:~-10! !random!=a
)
for /f "delims=.= " %%i in ('set .') do for /f "tokens=* delims=0" %%i in ("%%i") do if "%%i"=="" (set/p=0 <nul) else set/p=%%i <nul
pause>nul

@echo off&if not %1.==. goto%*

::plp@cn-dos.net|08-4-29

::数字排序。数字范围：（0-10^99）数字保存在dat.txt里,每行一个数字

if not exist dat.txt echo 缺少dat.txt&pause&exit

for /f "delims= " %%a in ('"%0" :sor^|sort')do echo %%a

pause

:sor

  setlocal enabledelayedexpansion

  for /f %%a in (dat.txt)do (set d=%%a

    call:byte&call:space

    echo\!sp!!d!

  )

exit/b

:byte

  for /l %%z in (1 1 100)do if "!d:~%%z,1!"=="" set/a byte=100-%%z&goto:eof

:space

  set "sp="

  for /l %%z in (1 1 %byte%)do set "sp=!sp! "

goto:eof

@echo off

for /f "delims=" %%a in (test.txt)do call:dd %%a

exit

:dd

if %1.=. goto:eof

>>dat.txt echo %1

shift

goto:dd

```
@echo off&if not %1.==. goto%*
::plp@cn-dos.net|08-4-29
::Number sorting. Number range: (0-10^99) Numbers are saved in dat.txt, one number per line
if not exist dat.txt echo Missing dat.txt&pause&exit
for /f "delims= " %%a in ('"%0" :sor^|sort')do echo %%a
pause
:sor
setlocal enabledelayedexpansion
for /f %%a in (dat.txt)do (set d=%%a
call:byte&call:space
echo\!sp!!d!
)
exit/b
:byte
for /l %%z in (1 1 100)do if "!d:~%%z,1!"=="" set/a byte=100-%%z&goto:eof
:space
set "sp="
for /l %%z in (1 1 %byte%)do set "sp=!sp! "
goto:eof

Numbers are not one per line. First use this code to change it to one per line

@echo off

for /f "delims=" %%a in (test.txt)do call:dd %%a

exit

:dd

if %1.=. goto:eof

>>dat.txt echo %1

shift

goto:dd

Last edited by plp626 on 2008-4-30 at 01:41 PM ]
```

''''''''      排序      ''''''''

''''''''s11ss 2007-10-18''''''''



option explicit

'接收输入：

dim s,r,n,i

s=inputbox(vbcrlf&vbcrlf&"以空格隔开：","请输入一组数：","2007 10 18 21 15")

if s="" then wscript.quit

r=split(s," ")

n=ubound(r)

        '把字符串转换为Double 子类型：

for i=0 to n

        r(i)=cdbl(r(i))

next



'快速排序方法调用：

quicksort r,0,n

'其它排序方法的调用：

'insertsort r

'shellsort r

'bubblesort r

'selectsort r

'heapsort r



'输出结果：

inputbox vbcrlf&vbcrlf&"按升序排列是：","结果",join(r," ")



'各种排序子过程自定义：

'直接插入排序：

sub insertsort(r)

        dim i,n,t,j

        n=ubound(r)

        for i=1 to n'依次插入r(1),r(2),...,r(n)

                t=r(i)

                j=i-1

                do while t<r(j)'查找r(i)的插入位置

                        r(j+1)=r(j)'将大于r(i)的数后移

                        j=j-1

                        if j=-1 then exit do

                loop

                r(j+1)=t'插入r(i)

        next

end sub



'希尔排序：

sub shellsort(r)

                '设置增量序列：

        dim i,d(),n,t,k,h,j

        n=ubound(r)

        i=0

        redim d(n)

        d(i)=fix(n/2)

        do until d(i)=1

                t=d(i)

                i=i+1

                d(i)=fix(t/2)

        loop

                '排序：

        k=0

        do

                h=d(k)'取本趟增量

                for i=h to n'r(h)到r(n)插入当前有序区

                        t=r(i)'保存待插入数

                        j=i-h

                        do while t<r(j)'查找正确的插入位置

                                r(j+h)=r(j)'后移

                                j=j-h'得到前一数的位置

                                if j<0 then exit do

                        loop

                        r(j+h)=t'插入r(i)

                next'本趟排序完成

                k=k+1

        loop while h<>1

end sub



'冒泡排序：

sub bubblesort(r)

        dim i,n,noswap,j,t

        n=ubound(r)

        for i=0 to n-1'做n趟排序

                noswap=True'置未交换标志

                for j=n-1 to i step -1'从下往上扫描

                        if r(j+1)<r(j) then'交换

                                t=r(j)

                                r(j)=r(j+1)

                                r(j+1)=t

                                noswap=False

                        end if

                next

                if noswap then exit for'本趟排序中未发生交换则终止算法

        next

end sub



'快速排序：

        '划分：

function partition(r,l,h)

        dim i,j,t

        i=l

        j=h

        t=r(i)'初始化，t为基准

        do 

                while r(j)>=t and i<j

                        j=j-1'从右向左扫描，查找第1个小于t的数

                wend

                if i<j then 

                        r(i)=r(j)'交换r(i)和r(j)

                        i=i+1

                end if

                while r(i)<=t and i<j

                        i=i+1'从左向右扫描，查找第1个大于t的数

                wend

                if i<j then 

                        r(j)=r(i)'交换r(i)和r(j)

                        j=j-1

                end if                

        loop while i<>j

        r(i)=t'基准t已被最后定位

        partition=i

end function

        '排序：

sub quicksort(r,s1,t1)

        dim i

        if s1<t1 then'只有一个数或无数时无须排序

                i=partition(r,s1,t1)'对r(s1)到r(t1)做划分

                quicksort r,s1,i-1'递归处理左区间

                quicksort r,i+1,t1'递归处理右区间

        end if

end sub



'直接选择排序：

sub selectsort(r)

        dim i,n,k,j,t

        n=ubound(r)

        for i=0 to n-1'做n趟排序

                k=i

                for j=i+1 to n'在当前无序区选最小的数r(k)

                        if r(j)<r(k) then k=j

                next

                if k<>i then

                        t=r(i)

                        r(i)=r(k)

                        r(k)=t

                end if

        next

end sub



'堆排序：

        '筛选：

sub sift(r,i,m)'以r(i)为根的完全二叉树构成堆

        dim t,j

        t=r(i)

        j=2*i

        do while j<=m'j<=m,r(2*i)是r(i)的左孩子

                if j<m then

                        if r(j)<r(j+1) then j=j+1'j指向r(i)的右孩子

                end if

                if t<r(j) then'孩子节点的数较大

                        r(i)=r(j)'将r(j)换到双亲位置上

                        i=j'修改当前被调整节点

                        j=2*i

                else

                        exit do'调整完毕，退出循环

                end if

        loop

        r(i)=t'最初被调整节点放入正确位置

end sub

        '排序：

sub heapsort(r)

        dim i,n,t

        n=ubound(r)

        for i=fix(n/2) to 0 step -1'建初始堆

                sift r,i,n

        next

        for i=n to 0 step -1'进行n+1趟排序

                t=r(0)'当前堆顶数和最后一个数交换

                r(0)=r(i)

                r(i)=t

                sift r,0,i-1'r(0)到r(i-1)重建成堆

        next

end sub

I wonder if brother s11ss's sorting algorithm can meet the building owner's needs

''''''''      Sorting      ''''''''

''''''''s11ss 2007-10-18''''''''



option explicit

'receive input:

dim s,r,n,i

s=inputbox(vbcrlf&vbcrlf&"Separate with spaces:","Please enter a group of numbers:","2007 10 18 21 15")

if s="" then wscript.quit

r=split(s," ")

n=ubound(r)

        'Convert string to Double subtype:

for i=0 to n

        r(i)=cdbl(r(i))

next



'Call quick sort method:

quicksort r,0,n

'Call other sorting methods:

'insertsort r

'shellsort r

'bubblesort r

'selectsort r

'heapsort r



'Output result:

inputbox vbcrlf&vbcrlf&"In ascending order is:","Result",join(r," ")



'Customize various sorting subroutines:

'Direct insertion sort:

sub insertsort(r)

        dim i,n,t,j

        n=ubound(r)

        for i=1 to n'Insert r(1), r(2),..., r(n) in turn

                t=r(i)

                j=i-1

                do while t<r(j)'Find the insertion position of r(i)

                        r(j+1)=r(j)'Shift numbers larger than r(i) backward

                        j=j-1

                        if j=-1 then exit do

                loop

                r(j+1)=t'Insert r(i)

        next

end sub



'Shell sort:

sub shellsort(r)

                'Set increment sequence:

        dim i,d(),n,t,k,h,j

        n=ubound(r)

        i=0

        redim d(n)

        d(i)=fix(n/2)

        do until d(i)=1

                t=d(i)

                i=i+1

                d(i)=fix(t/2)

        loop

                'Sort:

        k=0

        do

                h=d(k)'Take the increment of this pass

                for i=h to n'r(h) to r(n) insert into the current ordered area

                        t=r(i)'Save the number to be inserted

                        j=i-h

                        do while t<r(j)'Find the correct insertion position

                                r(j+h)=r(j)'Shift backward

                                j=j-h'Get the position of the previous number

                                if j<0 then exit do

                        loop

                        r(j+h)=t'Insert r(i)

                next'Complete this pass of sorting

                k=k+1

        loop while h<>1

end sub



'Bubble sort:

sub bubblesort(r)

        dim i,n,noswap,j,t

        n=ubound(r)

        for i=0 to n-1'do n passes of sorting

                noswap=True'set unswapped flag

                for j=n-1 to i step -1'scan from bottom up

                        if r(j+1)<r(j) then'exchange

                                t=r(j)

                                r(j)=r(j+1)

                                r(j+1)=t

                                noswap=False

                        end if

                next

                if noswap then exit for'terminate the algorithm if no swap occurs in this pass of sorting

        next

end sub



'Quick sort:

        'Partition:

function partition(r,l,h)

        dim i,j,t

        i=l

        j=h

        t=r(i)'Initialize, t is the pivot

        do 

                while r(j)>=t and i<j

                        j=j-1'scan from right to left, find the first number less than t

                wend

                if i<j then 

                        r(i)=r(j)'exchange r(i) and r(j)

                        i=i+1

                end if

                while r(i)<=t and i<j

                        i=i+1'scan from left to right, find the first number greater than t

                wend

                if i<j then 

                        r(j)=r(i)'exchange r(i) and r(j)

                        j=j-1

                end if                

        loop while i<>j

        r(i)=t'the pivot t has been finally positioned

        partition=i

end function

        'Sort:

sub quicksort(r,s1,t1)

        dim i

        if s1<t1 then'no need to sort if there is one number or no number

                i=partition(r,s1,t1)'partition r(s1) to r(t1)

                quicksort r,s1,i-1'recursively process the left interval

                quicksort r,i+1,t1'recursively process the right interval

        end if

end sub



'Direct selection sort:

sub selectsort(r)

        dim i,n,k,j,t

        n=ubound(r)

        for i=0 to n-1'do n passes of sorting

                k=i

                for j=i+1 to n'select the smallest number r(k) in the current unsorted area

                        if r(j)<r(k) then k=j

                next

                if k<>i then

                        t=r(i)

                        r(i)=r(k)

                        r(k)=t

                end if

        next

end sub



'Heap sort:

        'Sift:

sub sift(r,i,m)'the complete binary tree with r(i) as the root forms a heap

        dim t,j

        t=r(i)

        j=2*i

        do while j<=m'j<=m, r(2*i) is the left child of r(i)

                if j<m then

                        if r(j)<r(j+1) then j=j+1'j points to the right child of r(i)

                end if

                if t<r(j) then'child node has a larger number

                        r(i)=r(j)'move r(j) to the parent position

                        i=j'revise the current adjusted node

                        j=2*i

                else

                        exit do'adjustment completed, exit loop

                end if

        loop

        r(i)=t'the initially adjusted node is placed in the correct position

end sub

        'Sort:

sub heapsort(r)

        dim i,n,t

        n=ubound(r)

        for i=fix(n/2) to 0 step -1'build initial heap

                sift r,i,n

        next

        for i=n to 0 step -1'do n+1 passes of sorting

                t=r(0)'swap the current heap top number with the last number

                r(0)=r(i)

                r(i)=t

                sift r,0,i-1'rebuild the heap from r(0) to r(i-1)

        next

end sub

@echo off&setlocal enabledelayedexpansion

set "str=101 20 14 13 19 18 16 11 5"

for %%i in (%str%) do set a=%%i&call :lp

echo %str%

pause>nul&goto :eof

:lp

for %%i in (%str%) do (

    if %%i lss %a% (

       set str=!str:%a% =!

       set str=!str:%%i=%%i %a%!

    )

)

Depressed, the single digits cannot have duplicates:

@echo off&setlocal enabledelayedexpansion

set "str=101 20 14 13 19 18 16 11 5"

for %%i in (%str%) do set a=%%i&call :lp

echo %str%

pause>nul&goto :eof

:lp

for %%i in (%str%) do (

    if %%i lss %a% (

       set str=!str:%a% =!

       set str=!str:%%i=%%i %a%!

    )

)

Is my post on floor 8 not meeting the requirements?
Change `set/p str=输入数字(用空格隔开)` to `set "str=101 20 14 13 19 18 16 11 5"`
It should be okay, right?

Originally posted by terse at 2008-4-30 00:11:
Is the code on my 8th floor not meeting the requirements?
Change "set/p str=Enter numbers (separated by spaces)" to "set "str=101 20 14 13 19 18 16 11 5"
It should be okay, right?

Terse's code on the 8th floor is really powerful. To be honest, I still don't understand how it works. Brother Terse, can you help explain it?

Originally posted by plp626 at 2008-4-30 12:04 AM:
Why use cmd when you can have the convenience, speed, and efficiency of a Linux shell?
Disclosure: I don't understand Linux.

This doesn't require understanding Linux; you just need to download GNU's sort.exe and call it in a batch script.

Originally posted by terse at 2008-4-29 11:56 PM:
@echo off&setlocal enabledelayedexpansion
set/p str=Enter a number (separated by spaces)
for %%i in (%str%) do (
set str=0000000000%%i
set .!str:~-10! !random!=a
)
for /f "delims=.= " ...

Really powerful! I didn't understand it at first...

@echo off&setlocal enabledelayedexpansion
set/p str=Enter a number (separated by spaces)
for %%i in (%str%) do (
set str=0000000000%%i
set .!str:~-10! !random!=a
)
set .
pause
for /f "delims=.= " %%a in ('set .') do for /f "tokens=* delims=0" %%i in ("%%a") do if "%%i"=="" (set/p=0 <nul) else set/p=%%i <nul
pause>nul

After changing the code like this, I got a bit enlightened.

@echo off

setlocal enabledelayedexpansion

    set numbers=%random% %random% %random% %random% %random% %random% %random% %random%

    echo 排序前数组为: %numbers%

    call :sort %numbers%

    echo 排序后数组为: %ret:~1%

pause

goto :eof



:sort

    set num=%1

    set str=%*

    for %%i in (%str%) do if !num! gtr %%i set num=%%i

    set ret=%ret% %num%

    if not "!str:%num%=!" == "" call :sort !str:%num%=!

goto :eof

I used this before, but I forgot where it came from.

@echo off

setlocal enabledelayedexpansion

    set numbers=%random% %random% %random% %random% %random% %random% %random% %random%

    echo The array before sorting is: %numbers%

    call :sort %numbers%

    echo The array after sorting is: %ret:~1%

pause

goto :eof



:sort

    set num=%1

    set str=%*

    for %%i in (%str%) do if !num! gtr %%i set num=%%i

    set ret=%ret% %num%

    if not "!str:%num%=!" == "" call :sort !str:%num%=!

goto :eof