This book introduces the essential concepts of algorithm analysis required by core undergraduate and graduate computer science courses, in addition to providing a review of the fundamental mathematical notions necessary to understand these concepts. Features: includes numerous fully-worked examples and step-by-step proofs, assuming no strong mathematical background; describes the foundation of the analysis of algorithms theory in terms of the big-Oh, Omega, and Theta notations; examines recurrence relations; discusses the concepts of basic operation, traditional loop counting, and best case and worst case complexities; reviews various algorithms of a probabilistic nature, and uses elements of probability theory to compute the average complexity of algorithms such as Quicksort; introduces a variety of classical finite graph algorithms, together with an analysis of their complexity; provides an appendix on probability theory, reviewing the major definitions and theorems used in the book.

This book represents an introduction to 2D games using Flash ActionScript 3.0 as a platform. It approaches the field in a progressive way, classifying games in categories based on essential features and difficulty. It combines discussions on practical games and implementation details with topics pertaining to games theory. Our intention is to familiarize the reader with a set of games with enough variety to provide a solid background for approaching any other 2D game with ease.