2

Bi 1: Cho on code sau: int sum=0; for (j=1;j<=n;j++) for (i=n;i>0;i=i/5) sum=sum+1; Gi T(n) l gi tr ca sum sau khi thc hin chng trnh. a, a ra cng thc T(n). b, a ra v chng minh nh gi tim cn T(n). Bi 2: Danh sch ni i c m t bi cu trc d liu: Struct dllNode { int info; struct dllNode *next; //tr n nt k tip struct dllNode *prev; //tr n nt i trc }; Vit chng trnh con trn C void Remove (dllNode *dlist, int key); loi b phn t c trng info l bng key khi danh sch vi phn t u tin c tr bi dlist v a ra mn hnh danh sch thu c (gi thit phn t nh vy tn ti duy nht). Bi 3: Trnh by thut ton sp xp nhanh (quicksort) cho dy sau: 15 36 44 10 3 9 13 29 25

Bi 4: Cy nh phn: struct TreeNode { int info; struct TreeNode *left; struct TreeNode *right;}; a, Vit hm: bool CountInternal (TreeNode *root); nhn u vo l con tr root n gc ca cy, tr li s lng nt trong cy. b, K hiu n l s nt ca cy. a ra nh gi v thi gian ca hm CountInternal trong k hiu tim cn.