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

26697 Views

See similar Computing A Level tutors

Related Computing A Level answers

All answers ▸

What is method "Overloading" in object-oriented programming (OOP) ?


How do I solve a Karnaugh Map?


One member of a chess club sends a text file saved in Unicode. What meant by the term "Unicode" and why might this be necessary?


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


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–2024

Terms & Conditions|Privacy Policy