sirodiaz / datastructures Goto Github PK

Add more methods and implement interfaces for extend the functionality of list classes.
Methods to implement:

• fix iterator in ArrayList
• fix error with contains method in doubly linked list
• implement ArrayAccess
• create an abstract class (ListAbstract) and refactor code
• fix possible errors
• rewrite insertion in simply linked list
• test pop method in simply linked list
• create custom exceptions for many method cases
• modify some test methods for exception handling
• getLast
• contains
• indexOf
• lastIndexOf
• remove
• create documentation
• increase code quality

Generate raw data and generate benchmarks for different methods. Finally generate a .txt in benchmark folder that contains results generated. Benchmarks will be created in a different branch named, for example, benchmark.

• Create a benchmark branch
• Add Faker library for generate random data and store results in a txt or csv file
• Generate script for running benchmarks
• Store results in another file

For avoid using external array for working with disjoint sets it is needed to add an array attribute for store all nodes in the tree.

• Separate chaining hash table as a strategy
• Open addressing strategy
• throw exception in get and search method (BinaryTreeAbstract class)
• binary heap
• create SortedList with doubly linked list
• quicksort method
• searchLast with reduced visibility
• getNodeAt
• addAll
• removeAll
• deleteAll
• set
• subList