Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In computer science, the worst-case complexity (usually denoted in asymptotic notation) measures the resources (e.g. running time, memory) an algorithm requires in the worst-case. It gives an =upper bound on the resources required by the algorithm. In the case of running time, the worst-case time-complexity indicates the longest running time performed by an algorithm given any input of size n, and thus this guarantees that the algorithm finishes on time. Moreover, the order of growth of the worst-case complexity is used to compare the efficiency of two algorithms.

Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.