Write pseudocode for the linear search algorithm, and then explain it’s complexity using big-O notation

Pseudocode: FUNCTION linearSearch(list, searchTerm):               FOR index FROM 0 -> length(list):                               IF list[index] == searchTerm THEN                                               RETURN index                               ENDIF               ENDLOOP               RETURN -1 ENDFUNCTION Complexity: Recognize that the single for loop will access each element in the list once in WCS.If each element is accessed once, then as list grows the time taken (WCS) grows in linear timeTherefore : O(n)What about best case? Average case?Encourage comparison with other known/unknown algorithms

Answered by Jacob N. Computing tutor

27337 Views

See similar Computing A Level tutors

Related Computing A Level answers

All answers ▸

What is Reverse Polish Notation?


What is the difference between validation and verification?


Choose 3 types of malware, describe them and the ways in which they may harm a device.


Given an unlimited number of light bulbs (that break at a certain height), and a building with 100 floors, how do you determine the height that the light bulb breaks?


We're here to help

contact us iconContact usWhatsapp logoMessage us on Whatsapptelephone icon+44 (0) 203 773 6020
Facebook logoInstagram logoLinkedIn logo

© MyTutorWeb Ltd 2013–2025

Terms & Conditions|Privacy Policy
Cookie Preferences