236,87 €
263,19 €
-10% with code: EXTRA
Introduction to Algorithms
Introduction to Algorithms
236,87
263,19 €
  • We will send in 10–14 business days.
Finite sequences of well-defined instructions are known as algorithms. These are used to perform various computations, calculations, data processing and solve classes of problems. Algorithms are unambiguous and computer implementable in nature. These can be represented in many different forms such as flow charts, natural languages, drakon-charts, pseudo code and control tables. These representations can be classified into high level description, implementation description and formal description…
  • Publisher:
  • ISBN-10: 1639893008
  • ISBN-13: 9781639893003
  • Format: 20.3 x 27.6 x 1.4 cm, hardcover
  • Language: English
  • SAVE -10% with code: EXTRA

Introduction to Algorithms (e-book) (used book) | bookbook.eu

Reviews

Description

Finite sequences of well-defined instructions are known as algorithms. These are used to perform various computations, calculations, data processing and solve classes of problems. Algorithms are unambiguous and computer implementable in nature. These can be represented in many different forms such as flow charts, natural languages, drakon-charts, pseudo code and control tables. These representations can be classified into high level description, implementation description and formal description. Algorithms can be broadly categorized on the basis of implementation, design and complexity. The means of implementation of algorithms are further divided into recursive algorithms, logical algorithms, serial algorithms, parallel algorithms, deterministic algorithms, exact and quantum algorithm. According to the level of complexity, they can be divided into constant time, logarithmic time, linear time, polynomial time and exponential time algorithms. This book presents the complex subject of algorithms in the most comprehensible and easy to understand language. Different approaches, evaluations and methodologies and advanced studies on algorithms have been included herein. This book is a complete source of knowledge on the present status of this important field.

EXTRA 10 % discount with code: EXTRA

236,87
263,19 €
We will send in 10–14 business days.

The promotion ends in 18d.11:25:36

The discount code is valid when purchasing from 10 €. Discounts do not stack.

Log in and for this item
you will receive 2,63 Book Euros!?
  • Publisher:
  • ISBN-10: 1639893008
  • ISBN-13: 9781639893003
  • Format: 20.3 x 27.6 x 1.4 cm, hardcover
  • Language: English English

Finite sequences of well-defined instructions are known as algorithms. These are used to perform various computations, calculations, data processing and solve classes of problems. Algorithms are unambiguous and computer implementable in nature. These can be represented in many different forms such as flow charts, natural languages, drakon-charts, pseudo code and control tables. These representations can be classified into high level description, implementation description and formal description. Algorithms can be broadly categorized on the basis of implementation, design and complexity. The means of implementation of algorithms are further divided into recursive algorithms, logical algorithms, serial algorithms, parallel algorithms, deterministic algorithms, exact and quantum algorithm. According to the level of complexity, they can be divided into constant time, logarithmic time, linear time, polynomial time and exponential time algorithms. This book presents the complex subject of algorithms in the most comprehensible and easy to understand language. Different approaches, evaluations and methodologies and advanced studies on algorithms have been included herein. This book is a complete source of knowledge on the present status of this important field.

Reviews

  • No reviews
0 customers have rated this item.
5
0%
4
0%
3
0%
2
0%
1
0%
(will not be displayed)