QUICKSORT

1. Gii thiu Chng ta xt thut ton QuickSort vi dy kha so snh ngu nhin c lp vi nhau l X1, X2, , Xn. Vi mi thnh phn Xi c th l cc t hoc c th l mt chui s. T c th to thnh mt chui v hn cc bit biu din cho mt tp cc k t hoc tp cc k s. Thut ton QuickSort cn sp xp dy X1, X2,,Xn cn chn ra ngu nhin mt phn t lm trung tm so snh cc phn t. v sau qu trnh x l qui ng vi hai dy con gm mt dy nh hn phn t trung tm v mt dy gn cc phn t ln hn phn t trung tm. Gi Cn l gi tr chi ph sp xp cc phn t trong QuickSort ng vi mt hm chi ph c, khi cc bin Cn l cc bin ngu nhin trn mt khng gian xc sut bng cch s dng Cn = c(X1, X2,,Xn). y, Cn khng gim ng vi gi tr n. T y, ta a ra hi t ca gi tr chi ph thut ton v cn phi xp x gi tr ca chi ph thut ton ng vi cc ln thc hin thut ton. Ni mt cch khc, nu cc kha c mt t nh cc k s hoc k t v c thc hin qu trnh so snh bng cch duyt tun t t tri qua phi v so snh vi gi tr trung tm, chi ph so snh hai gi tr kha xc nh bi s lng Ta thc hin QuickSort trn n thnh phn ngu nhin c lp c cc kha phn phi ngu nhin xc nh. Chng ta s a ra c s gii hn phn phi ca dy ngu nhin gm cc k s cn so snh sau khi c chun ha vi tm l k vng sau chia cho n phn t