Produktbild: Essential Algorithms

Essential Algorithms A Practical Approach to Computer Algorithms Using Python and C

55,99 €

inkl. gesetzl. MwSt., Versandkostenfrei


Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

29.05.2019

Verlag

John Wiley & Sons

Seitenzahl

800

Maße (L/B/H)

23,3/18,7/4,8 cm

Gewicht

1342 g

Auflage

2nd edition

Sprache

Englisch

ISBN

978-1-119-57599-3

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

29.05.2019

Verlag

John Wiley & Sons

Seitenzahl

800

Maße (L/B/H)

23,3/18,7/4,8 cm

Gewicht

1342 g

Auflage

2nd edition

Sprache

Englisch

ISBN

978-1-119-57599-3

Herstelleradresse

Libri GmbH
Europaallee 1
36244 Bad Hersfeld
DE

Email: gpsr@libri.de

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)

Die Leseprobe wird geladen.
  • Produktbild: Essential Algorithms
  • Introduction xxix
     
    Chapter 1 Algorithm Basics 1
     
    Approach 2
     
    Algorithms and Data Structures 2
     
    Pseudocode 3
     
    Algorithm Features 6
     
    Big O Notation 7
     
    Rule 1 8
     
    Rule 2 8
     
    Rule 3 9
     
    Rule 4 9
     
    Rule 5 10
     
    Common Run Time Functions 11
     
    1 11
     
    Log N 11
     
    Sqrt N 14
     
    N 14
     
    N log N 15
     
    N² 15
     
    2^N 15
     
    N! 16
     
    Visualizing Functions 16
     
    Practical Considerations 18
     
    Summary 19
     
    Exercises 20
     
    Chapter 2 Numerical Algorithms 23
     
    Randomizing Data 23
     
    Generating Random Values 23
     
    Generating Values 24
     
    Ensuring Fairness 26
     
    Getting Fairness from Biased Sources 28
     
    Randomizing Arrays 29
     
    Generating Nonuniform Distributions 30
     
    Making Random Walks 31
     
    Making Self-Avoiding Walks 33
     
    Making Complete Self-Avoiding Walks 34
     
    Finding Greatest Common Divisors 36
     
    Calculating Greatest Common Divisors 36
     
    Extending Greatest Common Divisors 38
     
    Performing Exponentiation 40
     
    Working with Prime Numbers 42
     
    Finding Prime Factors 42
     
    Finding Primes 44
     
    Testing for Primality 45
     
    Performing Numerical Integration 47
     
    The Rectangle Rule 48
     
    The Trapezoid Rule 49
     
    Adaptive Quadrature 50
     
    Monte Carlo Integration 54
     
    Finding Zeros 55
     
    Gaussian Elimination 57
     
    Forward Elimination 58
     
    Back Substitution 60
     
    The Algorithm 61
     
    Least Squares Fits 62
     
    Linear Least Squares 62
     
    Polynomial Least Squares 64
     
    Summary 67
     
    Exercises 68
     
    Chapter 3 Linked Lists 71
     
    Basic Concepts 71
     
    Singly Linked Lists 72
     
    Iterating Over the List 73
     
    Finding Cells 73
     
    Using Sentinels 74
     
    Adding Cells at the Beginning 75
     
    Adding Cells at the End 76
     
    Inserting Cells After Other Cells 77
     
    Deleting Cells 78
     
    Doubly Linked Lists 79
     
    Sorted Linked Lists 81
     
    Self-Organizing Linked Lists 82
     
    Move to Front (MTF) 83
     
    Swap 83
     
    Count 84
     
    Hybrid Methods 84
     
    Pseudocode 85
     
    Linked-List Algorithms 86
     
    Copying Lists 86
     
    Sorting with Insertionsort 87
     
    Sorting with Selectionsort 88
     
    Multithreaded Linked Lists 90
     
    Linked Lists with Loops 91
     
    Marking Cells 92
     
    Using Hash Tables 93
     
    List Retracing 94
     
    List Reversal 95
     
    Tortoise and Hare 98
     
    Loops in Doubly Linked Lists 100
     
    Summary 100
     
    Exercises 101
     
    Chapter 4 Arrays 103
     
    Basic Concepts 103
     
    One-Dimensional Arrays 106
     
    Finding Items 106
     
    Finding Minimum, Maximum, and Average 107
     
    Finding Median 108
     
    Finding Mode 109
     
    Inserting Items 112
     
    Removing Items 113
     
    Nonzero Lower Bounds 114
     
    Two Dimensions 114
     
    Higher Dimensions 115
     
    Triangular Arrays 118
     
    Sparse Arrays 121
     
    Find a Row or Column 123
     
    Get a Value 124
     
    Set a Value 125
     
    Delete a Value 127
     
    Matrices 129
     
    Summary 131
     
    Exercises 132
     
    Chapter 5 Stacks and Queues 135
     
    Stacks 135
     
    Linked-List Stacks 136
     
    Array Stacks 138
     
    Double Stacks 139
     
    Stack