Assume an array of structure is in order by studentID field
of the record, where student IDs go from 101 to 500. Write
the most efficient pseudocode algorithm you can to find the
record with a specific studentID if every single student ID
from 101 to 500 is used and the array has 400 elements.
Write the most efficient pseudocode algorithm you can to
find a record with a studentID near the end of the IDs, say
in the range from 450 to 500, if not every single student
ID in the range of 101 to 500 is used and the array size is
only 300
- 0 Answers
- 1771 Views
- I also Faced
- E-Mail Answers
No Answer is Posted For this Question
Be the First to Post Answer
Explain function overloading
How one would use switch in a program?
What is &x in c++?
What is the last index number in an array of 100 characters a) 100 b) 99 c) 101
Explain virtual class?
when can we use virtual destructor?
7 Answers HCL, HP, Virage Logic,
what do you mean by memory management operators
Is string data type in c++?
What is the full form of india?
Write syntax to define friend functions in C++.
What is a virtual destructor?
What is an adaptor class or wrapper class in c++?
STL 
