jest zapoznanie studentów z podstawowymi strukturami danych i technikami algorytmicznymi, T. H. Cormen, C. E. Leiserson, R. L. Rivest, C. Stein (). Algorytmy i struktury danych. Wydanie Wprowadzenie do algorytmów. Cormen, Thomas H., Charles E. Leiserson, Ronald L. Rivest, Clifford Stein. Helion Aho A.V., Hopcroft J.E., Ullman J.D.: Projektowanie i analiza algorytmów Cormen T.H., Leiserson C.E,, Rivest R.L.: Algorytmy i struktury danych.
|Published (Last):||26 December 2012|
|PDF File Size:||1.59 Mb|
|ePub File Size:||14.21 Mb|
|Price:||Free* [*Free Regsitration Required]|
This course is not currently offered. WorldCat is the world’s largest library catalog, helping you find library materials online.
Strukktury lists, bibliographies and reviews: Estimating computation and time complexity of sorting algorithms: Divide and conquer algorithms. Algorytmika, WNT, Warszawa, Course descriptions are protected by copyright.
The name field is required. You already recently rated this item. The study of algorithms provides insight into the intrinsic nature of the problem as well as possible solution techniques independent of programming language, programming paradigm and computer hardware.
Wprowadzenie do algorytmów (Book, ) 
Wprowadzenie do algorytmow
TUTORIALS Students get acquainted with asymptotic analysis of upper and average complexity bounds, identify differences among best, average, and o case behaviors; simulate step-by-step selected algorithms on a board and analyze their behavior.
The Art of Computer Programming, vols. Fundamentals of analysis of algorithms Recurrence Sorting basic methods Abstract data structures Greedy algorithms Backtracking algorithms.
You may send this item to up to five recipients. Some features of WorldCat will not be available. Sorting algorithms quadratic-time sorts, quick sort, merge sort, radix sort. Decision trees; theorem on a lower bound for complexity of cormej arbitrary algorithm sorting by the comparison. Skip to main algoryhmy Skip to submenu Skip to content. Examples computing Fibonnaci numbers, multyplying matrices, the longest-common-subsequence problem. Please enter your name. Harel, Rzecz o istocie informatyki: Methods of solving recurrence relations.
Copyright by University of Silesia in Katowice. Your rating has been recorded.
Linked Data More info about Linked Data. Citations are based on reference standards.
Finding libraries that hold this item