Essential Algorithms: A Practical Approach to Computer Algorithms

Rod Stephens

Verlag: Wiley India Pvt. Ltd, 2013
ISBN 10: 8126546131 / ISBN 13: 9788126546138
Neu / Softcover / Anzahl: > 20
Verkäufer BookVistas (New Delhi, DELHI, Indien)
Bei weiteren Verkäufern erhältlich
Alle  Exemplare dieses Buches anzeigen

Über dieses Buch

Leider ist dieses Buch nicht mehr verfügbar. Bitte geben Sie Suchbegriffe in das untenstehende Formular ein, um ähnliche Exemplare zu finden.

Beschreibung:

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. Buchnummer des Verkäufers 75255

Über diesen Titel:

Inhaltsangabe: 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

„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.

Bibliografische Details

Titel: Essential Algorithms: A Practical Approach ...
Verlag: Wiley India Pvt. Ltd
Erscheinungsdatum: 2013
Einband: Softcover
Zustand: New

ZVAB ist ein Internet-Marktplatz für neue, gebrauchte, antiquarische und vergriffene Bücher. Bei uns finden Sie Tausende professioneller Buchhändler weltweit und Millionen Bücher. Einkaufen beim ZVAB ist einfach und zu 100% sicher — Suchen Sie nach Ihrem Buch, erwerben Sie es über unsere sichere Kaufabwicklung und erhalten Sie ihr Buch direkt vom Händler.

Millionen neuer und gebrauchter Bücher bei tausenden Anbietern

Antiquarische Bücher

Antiquarische Bücher

Von seltenen Erstausgaben bis hin zu begehrten signierten Ausgaben – beim ZVAB finden Sie eine große Anzahl seltener, wertvoller Bücher und Sammlerstücke.

ZVAB Startseite

Erstausgaben

Erstausgaben

Erstausgaben sind besondere Bücher, die den ersten Abdruck des Textes in seiner ursprünglichen Form darstellen. Hier finden sie Erstausgaben von damals bis heute.

Erstausgaben

Gebrauchte Bücher

Gebrauchte Bücher

Ob Bestseller oder Klassiker, das ZVAB bietet Ihnen eine breite Auswahl an gebrauchten Büchern: Stöbern Sie in unseren Rubriken und entdecken Sie ein Buch-Schnäppchen.

Gebrauchte Bücher

Mehr Bücher entdecken