Practice searching and sorting algorithms
Lesson details
Learning outcome
I can identify errors in flowcharts representing searching and sorting algorithms.
Key learning points
- Representing searching and sorting algorithms using flowcharts can help you to identify errors.
- On average, binary search can locate an item in a list in less time than linear search.
- If the data that you have is unordered, you must either use a linear search algorithm or sort the data first.
- Sorting algorithms can be used to sort data before a search is completed.
Keywords
Flowchart - a visual representation of an algorithm or program
Common misconception
If your data is not sorted then you cannot use a binary search.
Data does need to be sorted to use a binary search, though use of a sorting algorithm first would allow binary search to be used. However, consideration must be given as to the benefit of this approach for searching.
Teacher tip
Planning a flowchart before creating one is a great time saver. Outlining the algorithm in words first helps to plan the flow of the process before organising the appropraite shapes and arrows.
Licence
Lesson video
Loading...
Prior knowledge starter quiz
6 Questions
Q1.Match the algorithm to its key feature:
places each element in its correct position
uses divide-and-conquer to sort
moves the largest element to the correct position
requires a sorted list to work
Q2.Arrange the steps of bubble sort:
Q3.Arrange the steps of binary search:
Q4.Which sorting algorithm is most efficient for small data sets?
Q5.What is the first step in merge sort?
Q6.Which search algorithm checks each element in a list one by one to find a target?
Assessment exit quiz
6 Questions
Q1.What is the purpose of using a flowchart for searching and sorting algorithms?
Q2.What is the name of the symbol used to mark the start or end of a flowchart process?
Q3.What is the main advantage of binary search over linear search?
Q4.What is the purpose of sorting data before a search?
Q5.Arrange the steps of the merge sort algorithm in the correct order:
Q6.Match the term to its correct description:
requires data to be sorted before it can work
organises data into a specific order
can search data that is not sorted
uses symbols to represent the logic of an algorithm
To help you plan your 10 computer science lesson on: Practice searching and sorting algorithms, download all teaching resources for free and adapt to suit your pupils' needs...
To help you plan your 10 computer science lesson on: Practice searching and sorting algorithms, download all teaching resources for free and adapt to suit your pupils' needs.
The starter quiz will activate and check your pupils' prior knowledge, with versions available both with and without answers in PDF format.
We use learning cycles to break down learning into key concepts or ideas linked to the learning outcome. Each learning cycle features explanations with checks for understanding and practice tasks with feedback. All of this is found in our slide decks, ready for you to download and edit. The practice tasks are also available as printable worksheets and some lessons have additional materials with extra material you might need for teaching the lesson.
The assessment exit quiz will test your pupils' understanding of the key learning points.
Our video is a tool for planning, showing how other teachers might teach the lesson, offering helpful tips, modelled explanations and inspiration for your own delivery in the classroom. Plus, you can set it as homework or revision for pupils and keep their learning on track by sharing an online pupil version of this lesson.
Explore more key stage 4 computer science lessons from the Searching and sorting algorithms unit, dive into the full secondary computer science curriculum, or learn more about lesson planning.