Book Image

PHP 7 Data Structures and Algorithms

By : Rahman

5 (1)

Book Image

PHP 7 Data Structures and Algorithms

5 (1)

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

Preface

What this book covers

What you need for this book

Who this book is for

Reader feedback

Customer support

Free Chapter

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

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?

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

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)

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

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

Complexity of different tree data structures

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

Exploring Search Options

Exploring Search Options

Linear searching

Interpolation search

Exponential search

Search using hash table

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

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

Solving Problems with Advanced Techniques

Solving Problems with Advanced Techniques

Pattern matching algorithms

Implementing Knuth-Morris-Pratt algorithm

Greedy algorithms

Implementing Huffman coding algorithm

Understanding dynamic programming

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

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

Built-in PHP algorithms

Built-in support through PECL

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

Customer Reviews

5 (1)

5 star

100%

4 star

0

3 star

0

2 star

0

1 star

0

Standard PHP Library (SPL) and data structures

The Standard PHP Library (SPL), is one of the best possible features of the PHP language in last few years. SPL was created to solve common problems which were lacking in PHP. SPL extended the language in many ways but one of the striking features of SPL is its support of data structures. Though SPL is used for many other purposes, we are going to focus on the data structure part of SPL. SPL comes with core PHP installations and does not require any extension or change in configurations to enable it.

SPL provides a set of standard data structures through Object-Oriented Programming in PHP. The supported data structures are:

Doubly linked lists: It is implemented in SplDoublyLinkedList.
Stack: It is implemented in SplStack by using SplDoublyLinkedList.
Queue: It is implemented in SplQueue by using SplDoublyLinkedList.
Heaps: It is implemented in SplHeap. It also supports max heap in SplMaxHeap and min heap in SplMinHeap.
Priority queue: It is implemented in SplPriorityQueue by using SplHeap.
Arrays: It is implemented in SplFixedArray for a fixed size array.
Map: It is implemented in SplObjectStorage.

In coming chapters, we are going to explore each of the SPL data structure implementations and know their pros and cons, along with their performance analysis with our implementation of corresponding data structures. But as these data structures are already built in, we can use them for a quick turnaround of features and applications.

After the release of PHP 7, everyone was happy with the performance boost of the PHP application in general. PHP SPL is not having the similar performance boost in many cases, but we are going to analyze those in upcoming chapters.