Essential Algorithms: A Practical Approach to Computer Algorithms

 
9788126546138: Essential Algorithms: A Practical Approach to Computer Algorithms

This book provides an easy-to-read introduction to computer algorithms. It describes a number of important classical algorithms and tells when each is appropriate. It explains how to analyze algorithms to understand their behavior. Most importantly it teaches techniques that the reader can use to create new algorithms to meet future needs. Table of contents: introduction chapter 1: algorithm basics approach algorithms and data structures pseudo code algorithm features big o notation common runtime functions visualizing functions practical considerations summary exercises chapter 2: numerical algorithms randomizing data generating random values randomizing arrays generating nonuniform distributions finding greatest common divisors performing exponentiation working with prime numbers finding prime factors finding primes testing for primality performing numerical integration the rectangle rule the trapezoid rule adaptive quadrature monte carlo integration finding zeros summary exercises chapter 3: linked lists basic concepts singly linked lists iterating over the list finding cells using sentinels adding cells at the beginning adding cells at the end inserting cells after other cells deleting cells doubly linked lists sorted linked lists linked-list algorithms copying lists sorting with insertionsort linked list selectionsort multithreaded linked lists linked lists with loops marking cells using hash tableslist retracing list reversal tortoise and hare loops in doubly linked lists summary exercises chapter 4: arrays basic concepts one-dimensional arrays finding items finding minimum, maximum and average inserting items removing items nonzero lower bounds two dimensions higher dimensions triangular arrays sparse arrays find a row or column get a value set a value delete a value matrices summary exercises chapter 5: stacks and queues stacks linked-list stacks array stacks

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

Meilleurs résultats de recherche sur AbeBooks

1.

Rod Stephens
ISBN 10 : 8126546131 ISBN 13 : 9788126546138
Neuf(s) Soft cover Quantité : > 20
Edition internationale
Vendeur
Wagon Of Deals
(Edmonton, AB, Canada)
Evaluation vendeur
[?]

Description du livre 2013. Soft cover. État : New. International Edition. Book Condition: BRAND NEW. International/Eastern Economy Edition, Paperback/Softcover with SAME TITLE, AUTHOR AND EDITION as listed. ISBN and Cover design differs. **100% IDENTICAL CONTENTS as U.S Edition**. Standard Delivery within 7-14 business days ACROSS THE GLOBE. We can ship to PO Box, APO address in US. International Edition Textbooks may bear a label (Not for sale in the U.S. or Canada) or (For sale in Asia only) or similar restrictions- printed only to discourage students from obtaining an affordable copy. US Court has asserted your right to buy and use International edition. Access code/CD may not provided with these editions. We may ship the books from MULTIPLE WAREHOUSES ACROSS THE GLOBE including Asia depending upon the availability of inventory. Printed in English. Customer satisfaction guaranteed. N° de réf. du libraire ABECA8138

Plus d'informations sur ce vendeur | Poser une question au libraire

Acheter neuf
EUR 12,85
Autre devise

Ajouter au panier

Frais de port : EUR 3,95
De Canada vers Etats-Unis
Destinations, frais et délais

2.

Rod Stephens
Edité par Wiley India Pvt. Ltd (2013)
ISBN 10 : 8126546131 ISBN 13 : 9788126546138
Neuf(s) Softcover Quantité : > 20
Vendeur
BookVistas
(New Delhi, DELHI, Inde)
Evaluation vendeur
[?]

Description du livre Wiley India Pvt. Ltd, 2013. Softcover. État : New. This book provides an easy-to-read introduction to computer algorithms. It describes a number of important classical algorithms and tells when each is appropriate. It explains how to analyze algorithms to understand their behavior. Most importantly it teaches techniques that the reader can use to create new algorithms to meet future needs. Introduction Chapter 1 Algorithm Basics Approach Algorithms and Data Structures Pseudocode Algorithm Features Big O Notation Common Runtime Functions Visualizing Functions Practical Considerations Summary Exercises Chapter 2 Numerical Algorithms Randomizing Data Generating Random Values Randomizing Arrays Generating Nonuniform Distributions Finding Greatest Common Divisors Performing Exponentiation Working with Prime Numbers Finding Prime Factors Finding Primes Testing for Primality Performing Numerical Integration The Rectangle Rule The Trapezoid Rule Adaptive Quadrature Monte Carlo Integration Finding Zeros Summary Exercises Chapter 3 Linked Lists Basic Concepts Singly Linked Lists Iterating Over the List Finding Cells Using Sentinels Adding Cells at the Beginning Adding Cells at the End Inserting Cells After Other Cells Deleting Cells Doubly Linked Lists Sorted Linked Lists Linked-List Algorithms Copying Lists Sorting with Insertionsort Linked List Selectionsort Multithreaded Linked Lists Linked Lists with Loops Marking Cells Using Hash Tables List Retracing List Reversal Tortoise and Hare Loops in Doubly Linked Lists Summary Exercises Chapter 4 Arrays Basic Concepts One-dimensional Arrays Finding Items Finding Minimum, Maximum, and Average Inserting Items Removing Items Nonzero Lower Bounds Two Dimensions Higher Dimensions Triangular Arrays Sparse Arrays Find a Row or Column Get a Value Set a Value Delete a Value Matrices Summary Exercises Chapter 5 Stacks and Queues Stacks Linked-List Stacks Array Stacks Double Stacks Stack Algorithms Queues Linked-List Queues Array Queues Specialized Queues Summary Exercises Chapter 6 Sorting O(N2) Algorithms Insertionsort in Arrays Selectionsort in Arrays Bubblesort O(N log N) Algorithms Heapsort Quicksort Mergesort Sub O(N log N) Algorithms Countingsort Bucketsort Summary Exercises Chapter 7 Searching Linear Search Binary Search Interpolation Search Summary Exercises Chapter 8 Hash Tables Hash Table Fundamentals Chaining Open Addressing Removing Items Liner Probing Quadratic Probing Pseudorandom Probing Double Hashing Ordered Hashing Summary Exercises Chapter 9 Recursion Basic Algorithms Factorial Fibonacci Numbers Tower of Hanoi Graphical Algorithms Koch Curves Hilbert Curve Sierpin ski Curve Gaskets Backtracking Algorithms Eight Queens Problem Knight`s Tour Selections and Permutations Selections with Loops Selections with Duplicates Selections Without Duplicates Permutations with Duplicates Permutations Without Duplicates Recursion Removal Tail Recursion Removal Storing Intermediate Values General Recursion Removal Summary Exercises Chapter 10 Trees Tree Terminology Binary Tree Properties Tree Representations Building Trees in General Building Complete Trees Tree Traversal Preorder Traversal Inorder Traversal Postorder Traversal Depth-first Traversal Traversal Run Times Sorted Trees Adding Nodes Finding Nodes Deleting Nodes Threaded Trees Building Threaded Trees Using Threaded Trees Specialized Tree Algorithms The Animal Game Expression Evaluation Quadtrees Tries Summary Exercises Chapter 11 Balanced Trees AVL Trees Adding Values Deleting Values 2-3 Trees Adding Values Deleting Values B-Trees Adding Values Deleting Values Balanced Tree Variations Top-down B-trees B+trees Summary Exercises Chapter 12 Decision Trees Searching Game Trees Minimax Initial Moves and Responses Game Tree Heuristics Searching General Decision Trees Optimization Problems Exhaustive Search Branch and Bound Decision Tree Heuristics Other D Printed Pages: 624. N° de réf. du libraire 75255

Plus d'informations sur ce vendeur | Poser une question au libraire

Acheter neuf
EUR 13,22
Autre devise

Ajouter au panier

Frais de port : EUR 3,99
De Inde vers Etats-Unis
Destinations, frais et délais

3.

Rod Stephens
Edité par Wiley India Pvt. Ltd (2013)
ISBN 10 : 8126546131 ISBN 13 : 9788126546138
Neuf(s) Softcover Quantité : > 20
Vendeur
A - Z Books
(New Delhi, DELHI, Inde)
Evaluation vendeur
[?]

Description du livre Wiley India Pvt. Ltd, 2013. Softcover. État : New. This book provides an easy-to-read introduction to computer algorithms. It describes a number of important classical algorithms and tells when each is appropriate. It explains how to analyze algorithms to understand their behavior. Most importantly it teaches techniques that the reader can use to create new algorithms to meet future needs. Introduction Chapter 1 Algorithm Basics Approach Algorithms and Data Structures Pseudocode Algorithm Features Big O Notation Common Runtime Functions Visualizing Functions Practical Considerations Summary Exercises Chapter 2 Numerical Algorithms Randomizing Data Generating Random Values Randomizing Arrays Generating Nonuniform Distributions Finding Greatest Common Divisors Performing Exponentiation Working with Prime Numbers Finding Prime Factors Finding Primes Testing for Primality Performing Numerical Integration The Rectangle Rule The Trapezoid Rule Adaptive Quadrature Monte Carlo Integration Finding Zeros Summary Exercises Chapter 3 Linked Lists Basic Concepts Singly Linked Lists Iterating Over the List Finding Cells Using Sentinels Adding Cells at the Beginning Adding Cells at the End Inserting Cells After Other Cells Deleting Cells Doubly Linked Lists Sorted Linked Lists Linked-List Algorithms Copying Lists Sorting with Insertionsort Linked List Selectionsort Multithreaded Linked Lists Linked Lists with Loops Marking Cells Using Hash Tables List Retracing List Reversal Tortoise and Hare Loops in Doubly Linked Lists Summary Exercises Chapter 4 Arrays Basic Concepts One-dimensional Arrays Finding Items Finding Minimum, Maximum, and Average Inserting Items Removing Items Nonzero Lower Bounds Two Dimensions Higher Dimensions Triangular Arrays Sparse Arrays Find a Row or Column Get a Value Set a Value Delete a Value Matrices Summary Exercises Chapter 5 Stacks and Queues Stacks Linked-List Stacks Array Stacks Double Stacks Stack Algorithms Queues Linked-List Queues Array Queues Specialized Queues Summary Exercises Chapter 6 Sorting O(N2) Algorithms Insertionsort in Arrays Selectionsort in Arrays Bubblesort O(N log N) Algorithms Heapsort Quicksort Mergesort Sub O(N log N) Algorithms Countingsort Bucketsort Summary Exercises Chapter 7 Searching Linear Search Binary Search Interpolation Search Summary Exercises Chapter 8 Hash Tables Hash Table Fundamentals Chaining Open Addressing Removing Items Liner Probing Quadratic Probing Pseudorandom Probing Double Hashing Ordered Hashing Summary Exercises Chapter 9 Recursion Basic Algorithms Factorial Fibonacci Numbers Tower of Hanoi Graphical Algorithms Koch Curves Hilbert Curve Sierpin ski Curve Gaskets Backtracking Algorithms Eight Queens Problem Knight`s Tour Selections and Permutations Selections with Loops Selections with Duplicates Selections Without Duplicates Permutations with Duplicates Permutations Without Duplicates Recursion Removal Tail Recursion Removal Storing Intermediate Values General Recursion Removal Summary Exercises Chapter 10 Trees Tree Terminology Binary Tree Properties Tree Representations Building Trees in General Building Complete Trees Tree Traversal Preorder Traversal Inorder Traversal Postorder Traversal Depth-first Traversal Traversal Run Times Sorted Trees Adding Nodes Finding Nodes Deleting Nodes Threaded Trees Building Threaded Trees Using Threaded Trees Specialized Tree Algorithms The Animal Game Expression Evaluation Quadtrees Tries Summary Exercises Chapter 11 Balanced Trees AVL Trees Adding Values Deleting Values 2-3 Trees Adding Values Deleting Values B-Trees Adding Values Deleting Values Balanced Tree Variations Top-down B-trees B+trees Summary Exercises Chapter 12 Decision Trees Searching Game Trees Minimax Initial Moves and Responses Game Tree Heuristics Searching General Decision Trees Optimization Problems Exhaustive Search Branch and Bound Decision Tree Heuristics Other D Printed Pages: 624. N° de réf. du libraire 75255

Plus d'informations sur ce vendeur | Poser une question au libraire

Acheter neuf
EUR 13,22
Autre devise

Ajouter au panier

Frais de port : EUR 4,99
De Inde vers Etats-Unis
Destinations, frais et délais
Edition internationale
Edition internationale

4.

Rod Stephens
ISBN 10 : 8126546131 ISBN 13 : 9788126546138
Neuf(s) Softcover Edition originale Quantité : > 20
Edition internationale
Vendeur
LowPriceBookDeals
(Wilmington, DE, Etats-Unis)
Evaluation vendeur
[?]

Description du livre Softcover. État : New. 1st edition. Brand NEW, Paperback International Edition. Black & White or color, Cover and ISBN are same as ISBN stated with similar contents as US editions. Standard delivery takes 3-6 business days by USPS/UPS/Fedex with tracking number. Choose expedited shipping for superfast delivery 2-4 business days. We also ship to PO Box addresses. International Edition Textbooks may bear a label ÔNot for sale in the U.S. or CanadaÕ etc. printed only to discourage U.S. students from obtaining an affordable copy. Legal to use despite any disclaimer on cover as per US court. No access code or CD included unless specified. In some instances, the international textbooks may have different exercises at the end of the chapters. Printed in English. 100% Customer satisfaction guaranteed! Please feel free to contact us for any queries. N° de réf. du libraire LBDIN51500356

Plus d'informations sur ce vendeur | Poser une question au libraire

Acheter neuf
EUR 15,54
Autre devise

Ajouter au panier

Frais de port : EUR 3,17
Vers Etats-Unis
Destinations, frais et délais

5.

Rod Stephens
Edité par Wiley (2013)
ISBN 10 : 8126546131 ISBN 13 : 9788126546138
Neuf(s) Soft cover Edition originale Quantité : 1
Vendeur
Vedams eBooks (P) Ltd
(New Delhi, Inde)
Evaluation vendeur
[?]

Description du livre Wiley, 2013. Soft cover. État : New. Etat de la jaquette : New. 1st Edition. This book provides an easy-to-read introduction to computer algorithms. It describes a number of important classical algorithms and tells when each is appropriate. It explains how to analyze algorithms to understand their behavior. Most importantly it teaches techniques that the reader can use to create new algorithms to meet future needs. N° de réf. du libraire 111850

Plus d'informations sur ce vendeur | Poser une question au libraire

Acheter neuf
EUR 21,85
Autre devise

Ajouter au panier

Frais de port : EUR 14
De Inde vers Etats-Unis
Destinations, frais et délais