assume cs:code,ds:data,ss:stack
data segment
zifu db 'Binary Search Algorithms!','$' ;输出字符定义
begin db 'the number is :','$'
result db 'the result ID is: ','$'
number db '23','$'
shuju dw 2,18,6,23,54,22,9,60,46,32 ;定义排序的数据
zifushu db 100 dup(0) ;定义一个字符空间
cause db 100 dup(0)
lie db 0ah,'$' ;定义换行
r dw 10 ;定义左右区间及中间值
l dw 0
f dw 0
mid dw 0
data ends
stack segment ;定义栈段
dw 100 dup(0)
stack ends
code segment
start:
mov ax,data
mov ds,ax
mov ax,stack
mov ss,ax
mov sp,1600
mov dx,offset zifu ;输出
mov ah,9
int 21h
mov dx,offset lie ;换行
mov ah,9
int 21h
mov bx,offset shuju ;排序算法
mov si,0
mov cx,10
A1:
mov di,0
push cx ;外循环,cx入栈
A2: ;内循环
mov ax,[bx+di]
cmp ax,[bx+di+2] ;比较
ja A3
change:
;xchg ax,[bx+di+2] 交换
push ax
mov ax,[bx+di+2]
pop [bx+di+2]
mov [bx+di],ax
A3:
add di,2
loop A2
pop cx ;外循环
add si,2
loop A1
mov si,0 ;数据转换为字符
mov di,0
mov bx,0
