Analysis of Algoritthm

Asignment 3 - SORTING Algorithm

My project - OptiRoute is based on divide and conquer but I need to incorporate custom sorting

1 SUMMARY DESCRIPTIONUPDATE(Sorting)

My proposed term project is called "OptiRoute" and it is a routing optimization tool for delivery companies. The tool will take in a list of deliveries, each with their own addresses and specific delivery times, and output the most efficient route for a delivery driver to take in order to complete all of the deliveries on time. The tool will incorporate divide and conquer techniques in order to efficiently find the optimal route.

Provide Sorting for this project - Response here

2. I/O EXAMPLE FROM PROJECTED COMPLETED PROJECT

INPUT: (Delivery 1) 123 Main St, Anytown USA, Deliver by 9am, (Delivery 2) 456 Park Ave, Anytown USA, Deliver by 10am, (Delivery 3) 789 Elm St, Anytown USA, Deliver by 11am

OUTPUT: Optimal Route: 123 Main St -> 456 Park Ave -> 789 Elm St

Response here - Provide sorting I/O

3. REQUIREMENTS IMPLEMENTED IN THIS RELEASE

3.1 Input Accepted(title)

OptiRoute shall accept a list of deliveries, each with their own address, specific delivery time and priority level

3.2 Most Efficient Route

OptiRoute shall output the most efficient route for a delivery driver to take in order to complete all of the deliveries on time

Provide Sorting Requirement here

3.1 Your (very brief) requirement title replaces this

Your first requirement should replace this.

3.2 Your (very brief) requirement title replaces this

Your response should replace this.

4 ILLUSTRATIVE OUTPUT

Provide illustrative output from your actual application showing that the requirements have been met. Explain what class.method(s) produce it.

Optimal Route: 123 Main St -> 456 Park Ave -> 789 Elm St This output is produced by the class 'OptiRoute' and the method 'findOptimalRoute(deliveryList)', which takes in a list of deliveries as input and outputs the most efficient route for the driver to take

Provide Sorting ouput here

5. SPECIALIZED SORTING IMPLEMENTED

Your implementation should include specialized sorting in a manner that is useful to your application. Ideally, this should take advantage of specialized knowledge that you have about what needs to be sorted. If this is not feasible for your application, use a sorting method, other than insert sort, not covered in any of the notes. Explain where and how you applied this.

Provide answer here

6.Class model and Sequence Diagram

provide block diagram for sorting

7. Show the relevant sorting algorithm code (only) and explain why specialized sorting is appropriate here. It should be clear where the code is located (class and method). This should be consistent with section