hat
Kou sa a prezante metòd pou analize efikasite nan algoritm (ki gen ladan pi move ka-ak mwayèn-ka analiz) ak entwodui yon varyete de li te ye, algoritm trè efikas. Analiz, konsepsyon, ak aplikasyon algoritm yo bay egal anfaz. Sijè gen ladan chache ak klasman, efikasite nan operasyon sou estrikti done (ki gen ladan lis, hashtab, pyebwa balanse binè rechèch, charyo priyorite), algoritm graf, algoritm konbinatwar, repetition relijyon, dinamik Programming, NP-konplè pwoblèm, ak kèk sijè espesyal kòm tan pèmèt. (Sijè espesyal gen ladan jeyometri enfòmatik, algoritm pou kriptoksosyòm, apwoksimasyon, Big Done ak paralèl informatique.)
eng
This course presents methods for analyzing the efficiency of algorithms (including worst-case and average-case analysis) and introduces a variety of known, highly efficient algorithms. Analysis, design, and implementation of algorithms are given equal emphasis. Topics include searching and sorting, efficiency of operations on data structures (including lists, hashtables, balanced binary search trees, priority queues), graph algorithms, combinatorial algorithms, recurrence relations, Dynamic Programming, NP-complete problems, and some special topics as time allows. (Special topics include computational geometry, algorithms for cryptosystems, approximation, Big Data and parallel computing.)