156. OCR A Level (H446) SLR26 – 2.3 Implement quick sort
About this video
OCR Specification Reference
A Level 2.3.1f
The insertion sort is one of four sorting algorithms students need to know for A Level exams. This video explains the quick sort technique.
Key questions:
- Can you successfully implement a quicksort using a high-level programming language of your choice?
- Do you understand how a quicksort works and can you trace its code to explain how it works?
00:00 Implementing a quicksort
00:07 Intro
00:12 Checklist
00:32 What is the quicksort algorithm?
01:24 What are the applications of a quicksort?
01:49 Visualising a quicksort
02:23 Quicksort pseudocode
02:43 Quicksort in simple-structured English
03:15 From simple-structured English to pseudocode
08:22 Quicksort coded in Python
26:20 Alternative implementations of quicksort
26:59 Key questions
27:17 Essential algorithms for A Level Computer Science text book
28:22 Outro
Last updated: 28.07.26
Other videos on this course
-
155. OCR A Level (H446) SLR26 – 2.3 Implement merge sort
-
157. OCR A Level (H446) SLR26 – 2.3 Dijkstra’s shortest path
-
158. OCR A Level (H446) SLR26 – 2.3 A star pathfinding
-
159. OCR A Level (H446) SLR26 – 2.3 A star pathfinding revisited
-
160. OCR A Level (H446) SLR26 – 2.3 Measures and methods to determine efficiency of algorithms