Sorting Algorithm & Non-linear Data Structure
Scenario: E-commerce business
Having created the classes, tested them with sample data and created a linked list with product information, you should sort the linked list in descending order from largest to smallest values, printing out both the values and the text labels.
You cannot use built-in sorting functions provided by Python, it should be your own algorithm for sorting a linked list. Any suitable sorting approach can be adopted.
You will then be converting the sorted linked list into a tree.
Assignment 2: Task 1
The tasks for this assessment are to produce:
1. Explain your algorithm briefly and list the steps you need to perform to implement your own sorting algorithm.
2. A Python program implementing your sorting algorithm.
Annotate your code with comments explaining why you have chosen the particular algorithm, how the code works and its complexity. The program must print out the LinkedList both before and after it has been sorted.
Assignment 1: Task 2
1. Using your sample data, create a three level tree data structure showing all product families, the associated product categories and the products in each product category.
2. Your code should include methods for traversing through the tree.
3. Your code should include methods to search for specific items.
Annotate your code with comments explaining how the code works and its complexity. You must demonstrate the traversal and searching in your program.
Your submission should be 1500 +/-10% (equivalent)
