Website: http://www.docs.vn Email : [email protected] Tel : 0918.775.368
Lời nói đầu
1
ần
ầ
ần
i i
C ương
I.
đ
i
i i
ng
đ
n
C ng i đ
1. i n n
ng i
Trong
2. C ng i
- -
1.
2.
-5-2005
N!
Fibonacci
t
2
i
3.
4.
II.
C ng i
ư
–
C ương
ó
n
n
1. KeO:
2. HienThi:
3. Call_n:
giaithua trong Unit dequy.tpu
4. Call_Fibonacci:
Fibonacci trong Unit dequy.tpu
5. Call_ThapHN:
ThapHaNoi trong Unit dequy.tpu
n
6. Call_XepHau:
XepHau trong Unit Dequy.tpu
7. Call_Select:
Select_Sort trong Unit SX_va_TK.tpu
p
3
8. Call_Insert:
Insert_Sort trong Unit SX_va_TK.tpu
9. Call_Bubble:
Bubble_Sort trong Unit SX_va_TK.tpu
10.Call_Quick:
Quick_Sort trong Unit SX_va_TK.tpu
11.Call_Heap:
12.Call_Mergring:
Head_Sort trong Unit SX_va_TK.tpu
Mergring_Sort trong Unit SX_va_TK.tpu
13.Call_TimTuanTu:
SX_va_TK.tpu
p
Sequen_Search
trong
Unit
14.Call_TimNhiPhan:
SX_va_TK.tpu
Binary_Search
trong
Unit
15.Call_DoiCoSo:
DoiCoSo trong Unint Stack.tpu
4
C ương 3 C i i
1. n!:
Begin
K= 1
I =2
K: = k*i
I: =i+1
True
I>N
GiaiThua: = k
False
END
5
2. Fibonacci:
if n< = 2 then F(n) = 1
F(n) = F(n-2) + F(n-1)
Begin
i=2
x=1
y=1
Fibo = 0
I = i+ 1
Tru
e
i< = n
False
END
6
Fibo = x+y
X=Y
Y = Fibo
3. ThapHaNoi
Begin
N
True
N<>0
False
Chuy n n -1 đia t a sang b
Out a b
Chuy n n -1 đia t c sang b
7
END
4. Select_Sort:
Begin
I=1
N
m=i
j = i+1
True
a[j] < a[m]
m=j
False
j = j+1
False
m <> i
I>N
True
True
M <> i
a[m]
False
I=i +1
False
i>n-1
END
8
5. Insert_Sort:
Begin
a [0] = -32767
N
i=2
X = a [i]
j=j-1
False
x < a[j]
a [j+1] = x
True
I=i+1
a[j+1] = a[j]
j=j-1
True
I<=N
False
END
9
6. Bubble_Sort:
Begin
i=1
N
j=n
False
a[j] < a[j-1]
J=J-1
True
False
J< I + 1
a[j] , a[j-1]
True
I = i+1
False
I > n-1
True
END
10
7. Quick_Sort:
Begin
i=l
N
j=r
x= a[(i+j) div 2]
True
a[i] < x
i=i+1
False
True
j=j-1
x< a[j]
False
True
a[j] , a[j]
i< = j
i=i+1
j=j-1
False
True
i< = j
False
True
R=j
L0
I = I+1
a[i] <> k
True
False
Sequen = i
END
12
9. Sequen_Search:
Begin
K
I=1
a[n+1]
=k
N<>0
I = I+1
a[i] <> k
True
False
Sequen = i
END
\
13
10. Binary_Search:
Begin
K
I = 1;
a[n+1]
=k
N<>0
Binary = 0
L< = r
False
True
M = (r+l) div 2
True
K < a[m]
R=m-1
False
True
K > a[m]
L=m+1
False
Binary = m
END
14
11. DoiCoSo:
Begin
X, Y
T=0
True
r = x mod y
x <> 0
False
True
pop(c,t,r)
push(c,t,r)
T>0
x = x div y
False
R
END
15
C ương 4 ư ng
i n ương n
n
16
ng
gi
Fibonacci:
ThapHaNoi:
17
XepHau:
Select_Sort:
18
Insert_Sort:
bubble_Sort:
19