C++

Skills Expected

• Linked Structures

• Algorithm: Searching (recursive) and Sorting

• OOP: Inner Class, Basic Inheritance and Overriding

• Big-O Notation

  Assignment Description

  As before, create a doubly-linked data structure with an inner Node class (feel free to modify your HW2 structure) used to keep track of multiple objects having the same parent class. Use the same sorting algorithm or experiment with a new one as HW2 your choice. Demonstrate recursive searching.

  Grading Criteria

• Implementation (13 Points Total): o [2 Points] Doubly-linked data structure o [2 Points] Inner Node class for the doubly-linked data structure o [3 Points] Parent object with at least two child objects o [2 Points] One Sort function for all 3 objects (parent + 2 child objects) o [3 Points] Search (must be recursive to get any points on this)

• Demonstration (6 Points Total):

o [2 Points] Doubly-linked structure containing all 3 object types o [2 Points] Demonstrated sort for one linked structure containing all 3

object types o [2Points]Search

Big-O Analysis (1 Point Total): o [1 Point] Recursive Sort (Is the big O different for recursive vs. iterative?)

C++

Skills Expected Linked Structures Algorithm: Searching (recursive) and Sorting OOP: Inner Class, Basic Inheritance and Overriding Big-o Notation Assignment Description As before, create a doubly-linked data structure with an inner Node class (feel free to modify your HW2 structure) used to keep track of multiple objects having the same parent class. Use the same sorting algorithm or experiment with a new one as HW2 - your choice. Demonstrate recursive searching. Notes: 0 points for HW3 if you use a Vector, STL, an existing sort() method, or if code doesn't compile. Up to 3 points deduction if invariants are not enforced. Up to 1 point deduction if code isn't readable. Grading Criteria Implementation (13 Points Total): o [2 Points] Doubly-linked data structure o [2 Points] Inner Node class for the doubly-linked data structure o [3 Points] Parent object with at least two child objects o [2 Points] One Sort function for all 3 objects (parent + 2 child objects) o [3 Points] Search (must be recursive to get any points on this) Demonstration (6 Points Total): o [2 Points] Doubly-linked structure containing all 3 object types o [2 Points] Demonstrated sort for one linked structure containing all 3 object types o [2 Points] Search Big-O Analysis (1 Point Total): o [1 Point] Recursive Sort (Is the big o different for recursive vs. iterative?)