Assume an array of structures is in order by the customerIDfield of the record,

Question

Assume an array of structures is in order by the customerIDfield of the record, where customer IDs go from 101 to 500. Write the most efficient pseudocode algorithm you can to finda record with a customer ID near the end of the IDs, say 494, ifnot every single customer ID in the range of 101 to 500 is used andthe array size is only 300. Assume an array of structures is in order by the customerIDfield of the record, where customer IDs go from 101 to 500. Write the most efficient pseudocode algorithm you can to finda record with a customer ID near the end of the IDs, say 494, ifnot every single customer ID in the range of 101 to 500 is used andthe array size is only 300.

Explanation / Answer

Observe the Java code given below to understand thebinary search algorithm in arrays.

We simply start from the middle of the array and check if wehave found a match. If not, we check to see if what we've gotis greater or lesser than the required value. If it be lesserthen we can confidently ignore all the values greater than ( andincluding ) the mid point. This goes on until we either finda match or when the "low" point is greater than the "high"point.

This algorithm, as must be evident, assumes the array itreceives as input to be in a perfectly sorted state, i.e., it worksonly so long as it is ensured that the array to be searched is inascending sorted order.

Related Questions

Navigate

• Browse (All)
• Browse A
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.