PHP 7 Data Structures and Algorithms

Name: PHP 7 Data Structures and Algorithms | Implement linked lists, stacks, and queues using PHP
Brand: Packt Publishing
Availability: OnlineOnly

Implement linked lists, stacks, and queues using PHP

Mizanur Rahman(Autor*in)

Packt Publishing

1. Auflage

Erschienen am 26. Mai 2017

300 Seiten

E-Book

ePUB mit Adobe-DRM

Systemvoraussetzungen

E-Book

PDF mit Adobe-DRM

Systemvoraussetzungen

978-1-78646-357-9 (ISBN)

ab 34,79 €

Als Download verfügbar

Merkliste: siehe Preise

Beschreibung

Alle Preise

Weitere Details

Weitere Ausgaben

Inhalt

Cover
Credits
About the Author
About the Reviewer
www.PacktPub.com
Customer Feedback
Table of Contents
Preface
Chapter 1: Introduction to Data Structures and Algorithms
Importance of data structures and algorithms
Understanding Abstract Data Type (ADT)
Different data structures
Struct
Array
Linked list
Doubly linked list
Stack
Queue
Set
Map
Tree
Graph
Heap
Solving a problem - algorithmic approach
Writing pseudocode
Converting pseudocode to actual code
Algorithm analysis
Calculating the complexity
Understanding the big O (big oh) notation
Standard PHP Library (SPL) and data structures
Summary
Chapter 2: Understanding PHP Arrays
Understanding PHP arrays in a better way
Numeric array
Associative array
Multidimensional array
Using an array as flexible storage
Use of multi-dimensional arrays to represent data structures
Creating fixed size arrays with the SplFixedArray method
Performance comparison between a regular PHP array and SplFixedArray
More examples using SplFixedArray
Changing from a PHP array to SplFixedArray
Converting a SplFixedArray to a PHP array
Changing the SplFixedArray size after declaration
Creating a multidimensional array using SplFixedArray
Understanding hash tables
Implementing struct using a PHP array
Implementing sets using a PHP array
Best usage of a PHP array
PHP array, is it a performance killer?
Summary
Chapter 3: Using Linked Lists
What is a linked list?
Different types of linked list
Doubly linked lists
Circular linked lists
Multi-linked lists
Inserting, deleting, and searching for an item
Inserting at the first node
Searching for a node
Inserting before a specific node
Inserting after a specific node
Deleting the first node
Deleting the last node
Searching for and deleting a node
Reversing a list
Getting the Nth position element
Understanding complexity for linked lists
Making the linked list iterable
Building circular linked list
Implementing a doubly linked list in PHP
Doubly linked list operations
Inserting at first the node
Inserting at the last node
Inserting before a specific node
Inserting after a specific node
Deleting the first node
Deleting the last node
Searching for and deleting one node
Displaying the list forward
Displaying the list backward
Complexity for doubly linked lists
Using PHP SplDoublyLinkedList
Summary
Chapter 4: Constructing Stacks and Queues
Understanding stack
Implementing a stack using PHP array
Understanding complexity of stack operations
Implementing stack using linked list
Using SplStack class from SPL
Real life usage of stack
Nested parentheses matching
Understanding queue
Implementing a queue using PHP array
Implementing a queue using linked list
Using SplQueue class from SPL
Understanding priority queue
Ordered sequence
Unordered sequence
Implementing priority queue using linked list
Implement a priority queue using SplPriorityQueue
Implementing a circular queue
Creating a double - ended queue (deque)
Summary
Chapter 5: Applying Recursive Algorithms - Recursion
Understanding recursion
Properties of recursive algorithms
Recursion versus iterative algorithms
Implementing Fibonacci numbers using recursion
Implementing GCD calculation using recursion
Different types of recursions
Linear recursion
Binary recursion
Tail recursion
Mutual recursion
Nested recursion
Building an N-level category tree using recursion
Building a nested comment reply system
Finding files and directories using recursion
Analyzing recursive algorithms
Maximum recursion depth in PHP
Using SPL recursive iterators
Using the PHP built-in function array_walk_recursive
Summary
Chapter 6: Understanding and Implementing Trees
Tree definition and properties
Implementing a tree using PHP
Different types of tree structures
Binary tree
Binary search tree
Self-balanced binary search tree
AVL tree
Red-black tree
B-tree
N-ary Tree
Understanding a binary tree
Implementing a binary tree
Creating a binary tree using a PHP array
Understanding the binary search tree
Inserting a new node
Searching a node
Finding the minimum value
Finding the maximum value
Deleting a node
Constructing a binary search tree
Tree traversal
In-order
Pre-order
Post-order
Complexity of different tree data structures
Summary
Chapter 7: Using Sorting Algorithms
Understanding sorting and their types
Understanding bubble sort
Implementing bubble sort using PHP
Complexity of bubble sort
Improving bubble sort algorithm
Understanding selection sort
Implementing selection sort
Complexity of selection sort
Understanding insertion Sort
Implementing insertion sort
Complexity of insertion sort
Understanding divide-and-conquer technique for sorting
Understanding merge sort
Implementing merge sort
Complexity of merge sort
Understanding quick sort
Implementing quick sort
Complexity of quick sort
Understanding bucket sort
Using PHP's built-in sorting function
Summary
Chapter 8: Exploring Search Options
Linear searching
Binary search
Analysis of binary search algorithm
Repetitive binary search tree algorithm
Searching an unsorted array - should we sort first?
Interpolation search
Exponential search
Search using hash table
Tree searching
Breadth first search
Implementing breadth first search
Depth first search
Implementing depth first search
Summary
Chapter 9: Putting Graphs into Action
Understanding graph properties
Vertex
Edge
Adjacent
Incident
Indegree and outdegree
Path
Types of graphs
Directed graphs
Undirected graphs
Weighted graphs
Directed acyclic graphs (DAG)
Representing graphs in PHP
Adjacency lists
Adjacency matrix
Revisiting BFS and DFS for graphs
Breadth first search
Depth first search
Topological sorting using Kahn's algorithm
Shortest path using the Floyd-Warshall algorithm
Single source shortest path using Dijkstra's algorithm
Finding the shortest path using the Bellman-Ford algorithm
Understanding the minimum spanning tree (MST)
Implementing Prim's spanning tree algorithm
Kruskal's algorithm for spanning tree
Summary
Chapter 10: Understanding and Using Heaps
What is a heap?
Heap operations
Implementing a binary heap in PHP
Analyzing the complexity of heap operations
Using heaps as a priority queue
Using heap sort
Using SplHeap, SplMaxHeap, and SplMinHeap
Summary
Chapter 11: Solving Problems with Advanced Techniques
Memoization
Pattern matching algorithms
Implementing Knuth-Morris-Pratt algorithm
Greedy algorithms
Implementing Huffman coding algorithm
Understanding dynamic programming
0 - 1 knapsack
Finding the longest common subsequence-LCS
DNA sequencing using dynamic programming
Backtracking to solve puzzle problem
Collaborative filtering recommendation system
Using bloom filters and sparse matrix
Summary
Chapter 12: PHP Built-In Support for Data Structures and Algorithms
Built-in PHP features for data structure
Using PHP array
SPL classes
Built-in PHP algorithms
Hashing
Built-in support through PECL
Installation
Interfaces
Vector
[Map]
Map
Set
Stack and queue
Deque
Priority queue
Summary
Chapter 13: Functional Data Structures with PHP
Understanding functional programming with PHP
First class functions
Higher order functions
Pure functions
Lambda functions
Closures
Currying
Partial applications
Getting started with Tarsana
Implementing stack
Implementing a queue
Implementing a tree
Summary
Index

Systemvoraussetzungen

Dateiformat: ePUB
Kopierschutz: Adobe-DRM (Digital Rights Management)

Systemvoraussetzungen:

Computer (Windows; MacOS X; Linux): Installieren Sie bereits vor dem Download die kostenlose Software Adobe Digital Editions (siehe E-Book Hilfe).
Tablet/Smartphone (Android; iOS): Installieren Sie bereits vor dem Download die kostenlose App Adobe Digital Editions oder die App PocketBook (siehe E-Book Hilfe).
E-Book-Reader: Bookeen, Kobo, Pocketbook, Sony, Tolino u.v.a.m. (nicht Kindle)

Das Dateiformat ePUB ist sehr gut für Romane und Sachbücher geeignet – also für „fließenden” Text ohne komplexes Layout. Bei E-Readern oder Smartphones passt sich der Zeilen- und Seitenumbruch automatisch den kleinen Displays an.
Mit Adobe-DRM wird hier ein „harter” Kopierschutz verwendet. Wenn die notwendigen Voraussetzungen nicht vorliegen, können Sie das E-Book leider nicht öffnen. Daher müssen Sie bereits vor dem Download Ihre Lese-Hardware vorbereiten.

Bitte beachten Sie: Wir empfehlen Ihnen unbedingt nach Installation der Lese-Software diese mit Ihrer persönlichen Adobe-ID zu autorisieren!

Weitere Informationen finden Sie in unserer E-Book Hilfe.

Dateiformat: PDF
Kopierschutz: Adobe-DRM (Digital Rights Management)

Systemvoraussetzungen:

Computer (Windows; MacOS X; Linux): Installieren Sie bereits vor dem Download die kostenlose Software Adobe Digital Editions (siehe E-Book Hilfe).
Tablet/Smartphone (Android; iOS): Installieren Sie bereits vor dem Download die kostenlose App Adobe Digital Editions oder die App PocketBook (siehe E-Book Hilfe).
E-Book-Reader: Bookeen, Kobo, Pocketbook, Sony, Tolino u.v.a.m. (nicht Kindle)

Das Dateiformat PDF zeigt auf jeder Hardware eine Buchseite stets identisch an. Daher ist eine PDF auch für ein komplexes Layout geeignet, wie es bei Lehr- und Fachbüchern verwendet wird (Bilder, Tabellen, Spalten, Fußnoten). Bei kleinen Displays von E-Readern oder Smartphones sind PDF leider eher nervig, weil zu viel Scrollen notwendig ist.
Mit Adobe-DRM wird hier ein „harter” Kopierschutz verwendet. Wenn die notwendigen Voraussetzungen nicht vorliegen, können Sie das E-Book leider nicht öffnen. Daher müssen Sie bereits vor dem Download Ihre Lese-Hardware vorbereiten.

Bitte beachten Sie: Wir empfehlen Ihnen unbedingt nach Installation der Lese-Software diese mit Ihrer persönlichen Adobe-ID zu autorisieren!

Weitere Informationen finden Sie in unserer E-Book Hilfe.

Als PDF speichern Als Link merken