Search and sort algorithms - remote
CP430 Live remote training course
An understanding of algorithms is fundamental to success in GCSE computer science this course will teach you how algorithms manipulate data to achieve desired aims.
Skip to course bookingAn understanding of algorithms is fundamental to success in computer science. To reach their full potential, students up to GCSE computer science need to be confident in using decomposition and abstraction to solve problems.
Explore how each of the core search and sort algorithms function; exploring how they manipulate data structures and compare the relative efficiency of different methods.
Who is it for?
This course is for current or prospective teachers of computer science who have some understanding of computer science principles.
Prior knowledge:
You’ll need to understand the basic building blocks of algorithms, and how they are represented in pseudocode and flowcharts. If you’re looking for support with these topics, we recommend the Representing algorithms using flowcharts and pseudocode course.
If you are entirely new to computer science, we recommend first participating in our one-day course: An introduction to algorithms, programming and data in computer science.
Course units:
- 01 | Tracing algorithms – Learn how to effectively trace algorithms to understand how they work and whether they can be improved.
- 02 | Practicing tracing algorithms – During this session you will have plenty of opportunity to practice your skills of tracing algorithms.
- 03 | Search algorithms – Search algorithms allow you to retrieve data stored within a data structure, this session explores different search algorithms including binary and linear searches.
- 04 | Comparing search algorithms – During this session you’ll compare different search algorithms, watching how they function using online simulators and comparing the efficiency of each algorithm.
- 05 | Sort algorithms – Sort algorithms arrange data into a sequential order. This session explores how bubble, merge and insertion sorts work.
How will you learn?
Scheduled live, interactive online sessions led by an experienced practitioner. Flexible facilitator-supported, participant-led tasks, involving deep exploration of the subject content.
How long is the course?
This course is approximately five hours in duration, split across several days.
Recommended next steps:
To compliment this course we also have Representing algorithms using flowcharts and pseudocode available.
Do you prefer to learn in a classroom?
If so, take a look at:
Search and sort algorithms - face to face
This course is delivered as part of the National Centre for Computing Education.
You will:
- Learn how algorithms manipulate data to achieve desired aims
- Be able to hand-trace algorithms and debug them
- Know the difference between different sort and search algorithms
- Evaluate the suitability for different algorithms depending on the data to which they are applied
This course is part of the Subject knowledge certificate
Subject knowledge certificate
Our professional development programme, Computer Science Accelerator, is designed to help you develop or refresh your subject knowledge and leads to a nationally recognised certificate.
Book this course
You need to be logged in to start the course.
Not got a STEM Learning account?
Create an account
An Introduction to algorithms, programming and data in computer science - remote
Create some simple block-based computer programs and discover how to implement them in the text based language Python.
An introduction to algorithms, programming and data in GCSE computer science - face to face
Create some simple block-based computer programs and discover how to implement them in the text based language Python.
An Introduction to Computer Networking for Teachers
Build your knowledge and understanding of computer networks as a computer science teacher