有2個陣列：
ary1 db 12,-35,0,126,-90,-5,68,120,1,-19
ary2 db 24,25,0,-38,-89,99,68,100,2,-20
通過暫存器傳遞引數，利用子程式格式解決問題data segment
arr db 12,-
15,0,
126,-90
,-5,
68,120,1,
-19arr2 db 24,25
,0,-
38,89,
99,68,
100,2,
-20cnt equ $-arr
data ends
code segment
assume cs:code,ds:data
start:mov ax,
data
mov ds,ax
mov cx,cnt
mov di,
0 mov dl,
'n'lop: inc di
cmp di,cnt-
1 je exit
call exch
exit2:
mov ah,
02h int
21h mov ah,
4ch int
21hexch proc near
mov bh,arr[di]
mov bl,arr2[di]
cmp bh,bl
jnge lop2
jmp lop3
lop2: mov arr[di]
,bl mov arr2[di]
,bh jmp lop
lop3: mov arr[di]
,bh,
mov arr2[di]
,bl jmp lop
exch endp
exit: mov bh,arr[4]
mov bl,arr2[4]
cmp bh,bl
jg exit3
jmp exit2
exit3:
mov dl,
'y' jmp exit2
code ends
endstart
彙編 求兩個數之和
data segment 定義位元組型別資料add1,add2,sum和cont 存放兩個加數的長度 add1 db 11h,11h,11h,11h,11h,11h add2 db 66h,55h,44h,33h,22h,11h sum db 6 dup 0 cont db 3 data ends ...
合併兩個陣列
include using namespace std int sortedinsert int a,int lena,int b,int lenb else printf d n a indexnew printf here lena d,lenb d n indexa,indexb indexn...
兩個陣列之和
題目描述 給定兩個亂序陣列，長度分別為m，n，要求列印出和最大的k個數，和是由兩個陣列中各乙個陣列相加而得。輸入 每行數字短橫符 分割兩個陣列，冒號分割 引數k輸出 輸出為和最大得k個數，和是兩個陣列中各乙個數相加而得。樣例輸入 2,4,1,7,7 3,2,5,6,1,9 6 樣例輸出 16,16,...