Giáo trình tin học đại cương (tái bản lần thứ ba) phần 1 trần đình khang

Ill H KHANG (Chu bien) NGUYf: GT.0000026707 WaNUY,NGUYENHONGPHU'ONG DObAlam,dothingocquynh,dotuananh GIAO TRINH TfA/ H O C m i c iM ic ; TRAN DINH KHANG (Chu bien) NGUYEN LINK GIANG, DO VAN UY, N G U Y £ n HONG PH l/O N G , DO BA LAM, DO THI NGQC QUYTVH, D TUAN ANH G I A O T R I N H TIN HOC DAI CtrONG (Tai ban Ian thir ba) NHA XUAT BAN BACH KHOA - H /lA ^ I B4n quyen thugc ve tru6ng D?i hgc Bich Khoa H i Npi Mpi hinh thiic xuat bin, chep m i khong c6 s\r cho phep bing vim bin cua trubng li vi phmn phip lu|t M i so; 22 - 2014/CXB/244 - 80/BKHN Bien muc tren xui't ban ph^m cua Thu viin Qu6c gia Viit Nam Gido trtnh tin hpc dai cirong / TrSn Dinh Khang Nguyfin Linh Giang, D6 van Uy - Tii ban iSn thii rM t c6 siira chfla vi b6 sung - H : Bich khoa H i Ndi, 2014 - 246tr.: hmh ve, bing ;24cm , Thu muc: tr 245 ISBN 978-604-911-829-6 Tin hoc dai cuong L iptnnh Thuittoin G iiotnnh 005.1 -d c l4 BKB0050p-CIP LOfI NO I d A u Gido troth Tin hpc d^i cuomg dugc bien soan theo chiromg trinh mon hQC Tin hpc d^i cvong gidng day tai Truong Dai hpc Bach Khoa Hi Npi Giao trinh cung c6 the lam tii lipu hpc tap cho sinh vien cac truong Dai hpc, Cao ding ky thuat va cong nghp Tong ca nuoc Vdi nyc tieu cung cap tai lipu hpc tpp cho sinh vien, nhom tic gia d i tap hpp bai giang va kinh nghipm ciia nhieu thay, c6 giao Vipn Cong nghp thong tin va Truyai thong, Truong Dai hpc Bach khoa Ha Npi de bien tap giao trinh Bo cvc giao trinh gdm ba phan chinh nhu sau: Phan I: Tin hgc can ban Phin trinh biy ve thong tin, du lipu, hp thong may tinh vi cac hp thong ung dyng Day la nhCmg kien thtic c5n ban ve tin hpc va may tinh, giup cho ngucri hpc co nen tang tot buoc tiep vio the gioi v6 ciing rpng Idn thipc ITnh vyc cong nghp thong tin Phan II: Giai quyet bdi loan Npi dung phan gioi thipu ve giai quySt bai toan, bieu dien thuyt toan va cac thuyt toan thong dyng Voi kinh nghipm nhieu nim thatn gia giang dyy, cac tac gii nhyn thiy, khong it sinh vien thyo ve tin hpc vi lip trinh nhung van thuong to Iting tung dung truoc mpt bai toin thyc te cin giai quyet Do do, phan giiip sinh vien c6 dupe tu ban dau v i biSt cich ap dyng cic kien thuc tin hpc de giii quyet mpt bii toan thyc tien Phan III: Lqp trinh Day li phan trpng tarn ciia giio trinh gioi thipu nhftng kien thuc nen ting ctia ngon ngO- lap trinh C, mpt ngon ngii m i hau het lap trinh vien chuyen nghipp deu su dyng Cuoi moi phin li mpt so cau hoi v i bii tap nhim giup byn dpc cting c6 nhinig kien thuc da hpc Cic tic gii xin biy to sy biet cm chan thinh doi voi cic thay c6 giio, cic dong nghi§p Vipn Cong nghp thong tin v i Truyen thong, Truong Dyi hpc Bich Khoai H i Npi, da giup v i dpng vien rat nhieu qui trinh bien soyn giio trinh Die bipt, xin gui loi cam om sau sic toi PCS D$ng Vin Chuyet v i TS Phym Ding: Hii da dinh thoi gian dpc bin thio v i cho nhung y kien dong g6p quy biu Prong qud trinh bien scan, mac dii d§ rat c6 ging, nhimg sai sot la dieu kho tnranh di6i, ckc tic gia rat mong nhan du then xl < - (-b-sqrt(A))/(2*a) x2 < - (-b+sqrt(A))/(2*a) else if delta = then xl2 < b/(2*a), Xuat; ngai$m k6p xl2 else Xuit: phuomg trinh khong c6 n g h i ^ thgrc end if 11.2.3.5 Thu|it toan sap xip day Bai toan; Cho mqt d3y hihi han cdc so (nguyen, th\rc), h3y sSp xep d5y theo chieu tang dan (hojc giam dan) gid tri cua c3c phan tii cia d3y C6 kha nhieu thuat toan s§p x ^ mpt day tang (ho3c gian) dan Trong gi3o trinh s6 gidi thicu mpt thu^t toan kha bien Bai todn s3p xep theo chi^u tang dan th^rc hi?n theo cac budc sau: N h ^ gia trjday Dau tien, so sanh phan hi x[l] voi n-1 phan hi * danh sich x[2], x[3], , x[n], neu x[ 1] Idm horn phan hi nao thi hodn vj nd vdi phAn hi 124 Tiep theo, so sdnh phan tu x[2] voi n-2 phan tu tu danh sdch x[3], x[4], , x[n], neu x[2] Ion hom phan tu nao thi ho^n vj no vdri phSn tu Tong quat a buoc thii i, so sanh phan tu x[i] vori n-i phan tu tu danh sach x[i+l], x[i+2], , x[n], neu x[i] 1dm horn phan tir nao thi hoan vj no vdi phan tu Ket thuc Thu4t loan du(rc mo ta nhu sau N hfp: Day so x[l], x[2], , x[n] Xuat; Day da s4p xep theo chieu gia tri cic phan tu tang din Thuft loan: for i = to n-1 for j = i+1 to n if x[i] > x[j] then tg 129