Search and sort algorithms - remote CK430 / C01
Summary
An 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.
During this course you'll go deep into understanding how search and sort algorithms function; you'll explore the purpose and how to use trace tables when working with algorithms. You'll explore 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.
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.
What topics are covered?
- 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 Professional Development Leader-supported, participant-led tasks, involving deep exploration of the subject content.
How long is this course?
This course is approximately five hours in duration, split across multiple sessions.
Who is the course leader?
-
Khalid Patel
Computing Senior Professional Development Lead (PDL)
... -
Outcomes
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
Sessions
| Date | Time | |
|---|---|---|
| 1 Search and sort algorithms - remote | 29 March 2024 | 09:30-11:00 |
| 3 Search and sort algorithms - remote | 29 March 2024 | 11:00-12:00 |
| 5 Search and sort algorithms - remote | 29 March 2024 | 12:30-13:30 |
Actions
Fees & Subsidies
Additional information
Our remote CPD courses for teachers are delivered across a series of sessions run at specific times and dates. Information on all course sessions can be found under the description of each course. To complete a course, all sessions are mandatory.
Alternative dates
Interested in this course?
Sign up to receive our emails to hear about the latest CPD available