Therefore, it usually works the same for both sorted and unsorted lists. However

Question

Therefore, it usually works the same for both sorted and unsorted lists.  However, if the elements of the list are sorted, you can somewhat improve the performance of the sequential search algorithm. For example, if the search item is not in the list, you can stop the search as soon as you find an element in the list that is larger than the search item. Write the function seqOrdSearch to implement a version of the sequential search algoritm for sorted lists.  Add this function to the class orderArrayListType and write a program to test it.  

Explanation / Answer

using namespace std; #include #include class orderArrayListType{ public: int a[10] = {1,4,6,9,10,13,19,20,29,57}; int seqOrdSearch(int value); }; int orderArrayListType::seqOrdSearch(int value) { int i = 0; while (i

Related Questions

Navigate

• Browse (All)
• Browse T
• Subjects

---

---

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