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

27416 Views

See similar Computing A Level tutors

Related Computing A Level answers

All answers ▸

When data is transmitted over long distances, latency can become an issue. Explain what latency is.


Simplify the boolean expression ¬(A.B)+A.


What is the difference between a high level language and a low level language?


When a stack is implemented using a 1-D array, adding a valid item can cause an execution error. Explain why an execution error can occur in this situation.


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