我是初学者,帮忙改一下程序谢谢!
data segment
buf db 23h,16h,08h,20h,64h,8ah,91h,35h,2bh,0ffh
cn equ $-buf
data ends
stack segment
sta db 10 dup(?)
top equ $-sta
stack ends
code segment
assume cs:code, ds:data, ss:stack
start:
mov ax,data
mov ds,ax
mov bx,offset buf
mov cx,cn
dec cx
mov al,[bx]
inc bx
lp:cmp al,[bx]
jbe next
mov al,[bx]
next:inc bx
dec cx
jnz lp
mov bl,al
and al,0f0h
mov cl,4
shl al,cl
add al,30h
mov dl,al
mov ah,02h
int 21h
and bl,0fh
add bl,30h
mov dl,bl
mov ah,02h
int 21h
mov ah,4ch
int 21h
code ends
end start
怎样让这段程序找出最大值!要怎么改呢?急,谢谢大家了