Algorithms and Analysis
Budget: $30 – $250 AUD
1. Implement the Nearest Neighbour Data Structures and their Operations
- Create an empty algorithm/data structure (implemented as a constructor that takes zero argu- ments).
- Search for the k-nearest neighbours of a query of coordinates and category (k is at least 1).
- Add a point to the set of points.
- Remove a point from the set of points.
2. Evaluate your Data Structures for Nearest Neighbour Queries
Evaluate the two implementions in terms of their time complexities for the different operations and different use case scenarios. Also I need a report on analysis and evaluation of the different implementations. The report should be no more than 5 pages.
- Create an empty algorithm/data structure (implemented as a constructor that takes zero argu- ments).
- Search for the k-nearest neighbours of a query of coordinates and category (k is at least 1).
- Add a point to the set of points.
- Remove a point from the set of points.
2. Evaluate your Data Structures for Nearest Neighbour Queries
Evaluate the two implementions in terms of their time complexities for the different operations and different use case scenarios. Also I need a report on analysis and evaluation of the different implementations. The report should be no more than 5 pages.