The team was founded for the OOP course held by the semester 2022.1, HUST, creating an application that can help people visualize sorting algorithms. Array is the most basic structure of computer science. Most operations as well as other data structures are built and performed on an array. In the scope of the software, the application will explain three sorting algorithms on an array: Merge sort, counting sort and radix sort.

• Package sourcecode/src/test
• Package sourcecode/src/visualso/sorting
• Class sourcecode/src/visualso/util/ArrayUtils.java
• Diagrams design
• README.md README.md (introduction video)
• Pull request feedback: Assess whether coding following the agreed OO schema and conventions.

• Package sourcecode/src/visualso/view (exclude HomeScreen.java)
• Package sourcecode/src/visualso/controller (exclude HomeController.java)
• Package sourcecode/src/visualso/listener (exclude SortListener.java)
• Class sourcecode/src/visualso/util/ColorUtils.java
• Report writer
• Pull request feedback: Assess whether new additions have conflicts with the old ones. (e.g. package class diagram is different from general ones)

• Package sourcecode/src/visualso/component (50%)
• Class sourcecode/src/visualso/view/HomeScreen.java
• Class sourcecode/src/visualso/controller/HomeController.java
• Class sourcecode/src/visualso/listener/SortListener.java
• Report writer
• Pull request feedback: Run developing programs and perform actions to test and report uncovered issues.

• Package sourcecode/src/visualso/component (50%)
• Package sourcecode/src/visualso/exception
• Class sourcecode/src/visualso/util/DataUtils.java
• Presentation designer
• Pull request feedback: Handle possible exceptions of new features.

1. VisualGO: https://visualgo.net/en
2. Algorithm Visualizer: https://algorithm-visualizer.org/