Book Image

PHP 7 Data Structures and Algorithms

By : Mizanur Rahman
5 (1)
Book Image

PHP 7 Data Structures and Algorithms

5 (1)
By: Mizanur Rahman

Overview of this book

PHP has always been the the go-to language for web based application development, but there are materials and resources you can refer to to see how it works. Data structures and algorithms help you to code and execute them effectively, cutting down on processing time significantly. If you want to explore data structures and algorithms in a practical way with real-life projects, then this book is for you. The book begins by introducing you to data structures and algorithms and how to solve a problem from beginning to end using them. Once you are well aware of the basics, it covers the core aspects like arrays, listed lists, stacks and queues. It will take you through several methods of finding efficient algorithms and show you which ones you should implement in each scenario. In addition to this, you will explore the possibilities of functional data structures using PHP and go through advanced algorithms and graphs as well as dynamic programming. By the end, you will be confident enough to tackle both basic and advanced data structures, understand how they work, and know when to use them in your day-to-day work

Related Content you might be interested in

Current Title:

Small book image
PHP 7 Data Structures and Algorithms
Mizanur Rahman
May, 2017 | 340 pages
Small book image
Hands-On Data Structures and Algorithms with Python – Third Edition
Dr Basant Agarwal
Jul, 2022 | 496 pages
Small book image
Beginning Java Data Structures and Algorithms
James Cutajar
Jul, 2018 | 202 pages
Small book image
Hands-On Data Structures and Algorithms with Kotlin
Chandra Sekhar Nayak | Rivu Chakraborty
Feb, 2019 | 220 pages
Table of Contents (14 chapters)
Preface
Preface
What this book covers
What you need for this book
Who this book is for
Conventions
Reader feedback
Customer support
Free Chapter
1
Introduction to Data Structures and Algorithms
Introduction to Data Structures and Algorithms
Importance of data structures and algorithms
Understanding Abstract Data Type (ADT)
Different data structures
Solving a problem - algorithmic approach
Writing pseudocode
Algorithm analysis
Understanding the big O (big oh) notation
Standard PHP Library (SPL) and data structures
Summary
2
Understanding PHP Arrays
Understanding PHP Arrays
Understanding PHP arrays in a better way
Using an array as flexible storage
Use of multi-dimensional arrays to represent data structures
Performance comparison between a regular PHP array and 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
3
Using Linked Lists
Using Linked Lists
What is a linked list?
Different types of linked list
Inserting, deleting, and searching for an item
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
Complexity for doubly linked lists
Using PHP SplDoublyLinkedList
Summary
4
Constructing Stacks and Queues
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
Understanding queue
Using SplQueue class from SPL
Understanding priority queue
Implementing priority queue using linked list
Implement a priority queue using SplPriorityQueue
Implementing a circular queue
Creating a double - ended queue (deque)
Summary
5
Applying Recursive Algorithms - Recursion
Applying Recursive Algorithms - Recursion
Understanding recursion
Different types of recursions
Building an N-level category tree using recursion
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
6
Understanding and Implementing Trees
Understanding and Implementing Trees
Tree definition and properties
Implementing a tree using PHP
Different types of tree structures
Understanding a binary tree
Implementing a binary tree
Creating a binary tree using a PHP array
Understanding the binary search tree
Constructing a binary search tree
Tree traversal
Complexity of different tree data structures
Summary
7
Using Sorting Algorithms
Using Sorting Algorithms
Understanding sorting and their types
Understanding bubble sort
Understanding selection sort
Understanding insertion Sort
Understanding divide-and-conquer technique for sorting
Understanding merge sort
Understanding quick sort
Understanding bucket sort
Using PHP's built-in sorting function
Summary
8
Exploring Search Options
Exploring Search Options
Linear searching
Binary search
Interpolation search
Exponential search
Search using hash table
Tree searching
Summary
9
Putting Graphs into Action
Putting Graphs into Action
Understanding graph properties
Types of graphs
Revisiting BFS and DFS for graphs
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
10
Understanding and Using Heaps
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
11
Solving Problems with Advanced Techniques
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
12
PHP Built-In Support for Data Structures and Algorithms
PHP Built-In Support for Data Structures and Algorithms
Built-in PHP features for data structure
SPL classes
Built-in PHP algorithms
Hashing
Built-in support through PECL
Vector
Summary
13
Functional Data Structures with PHP
Functional Data Structures with PHP
Understanding functional programming with PHP
Getting started with Tarsana
Implementing stack
Implementing a queue
Implementing a tree
Summary

Understanding the minimum spanning tree (MST)

Suppose we are designing our new office campus with multiple buildings interconnected to each other. If we approach the problem by considering the interconnectivity between each building, it will take a huge number of cables. However, if we could somehow connect all the buildings through a common connectivity where each building is connected to every other building with only one connection, then this solution will reduce the redundancy and cost. If we think of our buildings as vertices and the connectivity between buildings as the edges, we can construct a graph using this approach. The problem we are trying to solve is also known as the minimum spanning tree, or MST. Consider the following graph. We have 10 vertices and 21 edges. However, we can connect all 10 vertices with only nine edges (the dark line). This will...

Previous Section
End of Section 9
Next Section