Explore sorting algorithms and their analysis in this 50-minute PHP UK Conference talk. Dive into the world of computer science fundamentals, learning how to evaluate and compare different sorting methods through live demonstrations and visual aids. Discover the historical context of algorithms dating back to the 1800s while gaining insights into concepts such as stable vs. unstable sorting, Big O notation, and adaptive algorithms. Examine various sorting techniques including Insert Sort, Bubble Sort, and Quick Sort, and understand their implementations and performance characteristics. Investigate searching algorithms like Sequential and Binary Search, and their applications in PHP. Gain a deeper understanding of the importance of efficient sorting and searching in high-level languages and platforms, enhancing your ability to optimize code and solve complex problems.
Overview
Syllabus
Introduction
Who am I
What this talk is about
Why sort data
Stable vs Unstable Sorting
Big O notation
Linear growth
Adaptive
Insert Sort Recap
Knuth
Bubble Sort
Quick Sort
Pivot Index
Recursive
Quicksort
Sorting the array
SPLM
Sequential Search
Binary Search
Binary Search Example
Binary Search Summary
Sorting Algorithms
Google of PHP
Other sorting algorithms
Taught by
PHP UK Conference
Related Courses
-
Algorithms: Sorting and Searching Course (How To)
-
Data Structures & Algorithms III: AVL and 2-4 Trees, Divide and Conquer Algorithms
4.8 -
Data Structures and Algorithms in JavaScript
-
Algorithms for Searching, Sorting, and Indexing
5.0 -
Sorting and Searching Algorithms in JS
-
Data Structures and Algorithms
