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

JN
Answered by Jacob N. Computing tutor

27473 Views

See similar Computing A Level tutors

Related Computing A Level answers

All answers ▸

What is the difference between RAM & ROM and the ways they are used within a computer system?


In programming, some languages are compiled and others are interpreted. Define the difference between the two.


How do you convert from binary to decimal?


Explain how the fetch execute cycle works? Include the specific registers and buses being used


We're here to help

contact us iconContact ustelephone icon+44 (0) 203 773 6020
Facebook logoInstagram logoLinkedIn logo

© MyTutorWeb Ltd 2013–2025

Terms & Conditions|Privacy Policy
Cookie Preferences