Главная
Study mode:
on
1
Introduction
2
Who am I
3
What this talk is about
4
Why sort data
5
Stable vs Unstable Sorting
6
Big O notation
7
Linear growth
8
Adaptive
9
Insert Sort Recap
10
Knuth
11
Bubble Sort
12
Quick Sort
13
Pivot Index
14
Recursive
15
Quicksort
16
Sorting the array
17
SPLM
18
Sequential Search
19
Binary Search
20
Binary Search Example
21
Binary Search Summary
22
Sorting Algorithms
23
Google of PHP
24
Other sorting algorithms
Description:
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.

Algorithm, Review, Sorting

PHP UK Conference
Add to list
0:00 / 0:00