Ask your own question, for FREE!
MIT 6.189 A Gentle Introduction to Programming Using Python (OCW) 25 Online
OpenStudy (anonymous):

1. Use pseudocode to describe an algorithm which searches for values in a given range. It should fit the following description: • INPUT - An unsorted array A and two integers l and u • OUTPUT - TRUE if A contains an element which is both greater than l and less than u, FALSE otherwise 2. make a note of the algorithm’s time complexity using O-notation 3. implement the function in the programming language of your choice

OpenStudy (anonymous):

what part of this are you having trouble with?

OpenStudy (anonymous):

I don't get anything... I'm confused with everything... please help me

OpenStudy (anonymous):

just loop over the array and check each element against l and u for the range

OpenStudy (anonymous):

I want pseudocode please

OpenStudy (anonymous):

bool x=false; for each value in A if A > I and A < U x=true; return x;

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!