Question
) (40 pts) The following tasks deal with the Array-based and Linked List-based implementations of the Unordered List (AUList and LLUList). For full credit, you
) (40 pts) The following tasks deal with the Array-based and Linked List-based implementations of the Unordered List (AUList and LLUList). For full credit, you must add the requisite functions to the existing classes provided with the assignment with matching function signatures. In addition, remember that we will be using a driver program to test your code for sample inputs/outputs, so you can expect a heavy penalty if the class and header files (AUList.h, AUList.cpp, LLUList.h, LLUList.cpp) you submit do not compile and function. a. (Easy) Write function int getMin() for both AUList and LLUList that computes and returns the smallest element in the list. Ex: if an AUList myAL has elements (3, 2, 1, 4, 5, 6), then myAL.getMin() should return 1.
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started