题目:“冒泡法”对一组数进行排序。

无序字符表:ASDFGHJKLWERTYUIO4683

设计要求:按代码值大小升序或降序排列,并显示排序前后字符表。

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
assume ds:data,cs:code


data segment

table db 'ASDFGHJKLWERTYUIO4683'

len = $ -table 

data ends


code segment

sta:

mov ax,data

mov ds,ax

mov bx,0b800h

mov es,bx

xor di,di

call disPlay

mov cx,len

again:

xor si,si

mov di,1

push cx

mov cx,len-1

again_2:

mov al,[si]

cmp al,[di]

jb donot

mov ah,[di]

mov [si],ah

mov [di],al

donot:nop

inc di

inc si

loop again_2

pop cx

loop again

mov di,160

call disPlay

mov ah,4ch

int 21h

disPlay:

xor si,si

mov cx,len

again_3:

mov al,[si]

mov es:[di],al

add di,2

inc si

loop again_3

ret

code ends

end sta