part b. is to implement Spitlists as a linked member function of the Unsorted Li

Question

part b. is to implement Spitlists as a linked member function of the Unsorted List ADT. one of the answers that came up follow but is this in C++? If not can someone translate this to C++? bool IsThere(ItemType item) const; bool UnsortedType:: IsThere(itemType item) { Bool moreToSearch; Int location =0; Found = false; Moreto Search = (location < length); While(moreToSearch && !found) { switch(item.ComparedTo(info[location])) { Case LESS: Case GREATER: location ++; moreToSearch = (location< length); break; } } Return found; }

Explanation / Answer

if you're familiar with , and headers, take a look at this link it may be helpful http://www.cplusplus.com/forum/beginner/31251/

Related Questions

Navigate

• Browse (All)
• Browse P
• Subjects

---

---

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