You will need to use the ComparedTo() method of the ItemType class. You may not modify ItemType, and you may not modify UnsortedType beyond adding IsDescending.
Students using Java should do the same problem, but using the UnsortedStringList class as used in the first lab, and with String's instead of int's. Remember to use the compareTo() method of the String class.
In the comments for each function, indicate what is the big-O complexity of the function and briefly explain why.
Zip together the source files (.h and .cpp) you used and turn in the zip file (Blackboard Task submissions unfortunately get renamed).
70% of the credit is whether the code correctly determines if the list is sorted in descending order or not. If your code does not compile, your assignment will not receive any correctness points. 10% is for the big-O complexity explanation. The remaining 20% is based on programming style. Include your name in a comment on each file that you create or modify, indicate what you did in that file and the date you made the modification. Comment each function, use meaningful variable names (i as an index variable is ok, but otherwise, single letter variable names are a bad habit), use consistent indentation and provide proper spacing to make the code more readable. Never, ever, create your code in Word or another word processor.
WARNING: This is an individual assignment. Do it on your own. If you can't, ask me for help.