輕易學好C++編程技巧 - 進楷 (香港科技大學筆記 19課) 內容包括
1) base C++ review,
2) Pointers and Dynamic Objects,
3) Recursion,Linked Lists,
4) Stacks and Queues,
5) Algorithm Analysis,
6) Insertion Sort and Mergesort,
7) Quicksort,
8) Heaps and Heapsort,
9) Lower Bound of Sorting and Radix Sort,
10) Binary Trees and Binary Search Trees
11) AVL Trees,
12) B+ Trees
13) Graphs and Breadth-First Search
14) Depth-First Search
15) Connected Components, Directed Graphs,
16) Topological Sort
17) Hashing
18) Pattern Matching
19) Additional Review
標簽：
Pointers
Dynamic
Objects
review
上傳時間：
2014-10-10
上傳用戶：chfanjiang
DATAS SEGMENT
w dw 0
keybuf db 255
db 0
db 255 dup(0) ;定義鍵盤輸入需要的緩沖區
DATAS ENDS
Stacks SEGMENT
db 200 dup(?)
Stacks ENDS
CODES SEGMENT
ASSUME CS:CODES,DS:DATAS,SS:Stacks
START:
MOV AX,DATAS
MOV DS,AX
mov dx,offset keybuf ;用0a號功能，輸入一個字符串
mov ah,0ah ;用回車結束
int 21h
mov dl,0ah ;再進行換行，以便在下一行顯示轉換后的字符串
mov ah,2
int 21h
; push ax
; push dx
; mov dl,cl
; mov ah,02
; int 21h
; pop dx
; pop ax
mov bx,offset keybuf+1 ;取出字符串的字符個數，作為循環的次數
mov cl,[bx]
mov ch,0
mov ax,0
again:
inc bx
mov ax,[w]
push bx
mov bx,16
mul bx
pop bx ;是小寫字母，則轉換為大寫字母
mov [w],ax
mov dl,[bx] ;取出一個字符，
cmp dl,'9'
jbe lab1
cmp dl,'F'
jbe lab2
sub dl,32
lab2: sub dl ,07h
lab1: sub dl,30h
add [w],dx
loop again
mov ax,[w]
mov bx,-1
push bx
mov bx,10
lab3 :mov dx,0
div bx
push dx
cmp ax,0
jnz lab3
lab5: pop dx
cmp dx,-1
jz lab4
add dl,30h
mov ah,02
int 21h
jmp lab5 ;循環，處理完整個字符串
lab4: MOV AH,4CH
INT 21H
CODES ENDS
END START
標簽：
匯編
上傳時間：
2015-04-02
上傳用戶：wcc0310
