LearnITWithMrC

Home
Assessment GCSE
Year 9 Year 10 Year 11
3.1 Algorithms
Effective Notetaking Understanding Algorithms Decomposition Abstraction Flowcharts Flowcharts 2 Trace Tables Searching Algorithms Bubble Sort Merge Sort
3.2 Programming
Imperative Languages Variables Data Types Input/Output Arithmetic Operators Comparison Operators Using Selection For - loops While - loops Data Structures String Manipulation Random Numbers File Operations Procedures Program Structure Data Validation Data Authentication Errors and testing high and low level languages
3.3 Data representation
3.3.1 - Number Bases 3.3.2 - Converting Number Bases 1 3.3.4 - Binary Arithmetic 3.3.2 - Converting Number Bases 2 3.3.3 - Units of Information 3.3.5 - Character Encoding 3.3.6 - Representing images 3.3.7 - Representing Sound 3.3.8 - Data Compression 3.3.8 - Huffman Coding
3.4 Computer Systems
Boolean Logic Operating systems Utility Software Computer Architecture CPU Types of Memory Storage Media
3.5 Computer Networks
Networks Overview Network Topologies Network Hardware Network Protocols Network Security Network Layers

Overview

Learning Objectives

0 results forGuest

ID	Skill_name
3.1.3.1	I can understand and explain how the linear search algorithm works.
3.1.3.2	I can understand and explain how the binary search algorithm works.
3.1.3.3	I can compare and contrast linear and binary search algorithms.

🏁 Learning Objective Linear and Binary Search

Lesson Video

Lesson Tasks

Watch the Lesson video
Make notes on your notes sheet.
Read the lesson notes
Make notes on your notes sheet.
Complete the learning activities
Make any notes on your notes sheet.
Check the Learning outcomes
Update your learning objectives

Searching

Searching for information is one of the main tasks of any computer system. The speed at which information can be found is also very important, especially in real time systems where the data has to be found and updated very quickly.

Linear Search

A linear search checks each item in a list one at a time, without jumping over item, or to any item.

Linear Search to find an element "K" in a sorted list.

Linear search

The worst case complexity is O(n), sometimes known an O(n) search
Time taken to search elements keep increasing as the number of elements are increased.

Binary Search

In computer science, binary search, also known as half-interval search or logarithmic search, is a search algorithm that finds the position of a target value within a sorted array. It compares the target value to the middle element of the array; if they are unequal, the half in which the target cannot lie is eliminated and the search continues on the remaining half until it is successful.

Binary search runs in at worst logarithmic time, making O(log n) comparisons, where n is the number of elements in the array and log is the binary logarithm.