SAGUI - Sorting Algorithms GUI

Mindmap SAGUI Project

Overview

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 this project, we make an application GUI to explain three sorting algorithms on an array: bubble sort, heap sort, shell sort

Specifications:

• GUI: Freely design own GUI. However, since the basic aim of the project is to develop an application based on OOP, focusing on the interface is not required.

  • Sorting (Bubble, Selection, Insertion, Merge, Quick, Counting, Radix)

  • Bubble Sort

  • Heap Sort

  • Shell Sort

• Design:

  • On the main menu: title of the application, 3 types of sort algorithms for the user to choose, help menu, quit
    • User must select a sort type to start the demonstration.
    • Help menu shows the basic usage and aim of the program.
    • Quit option exits the program - ask for confirmation.
  • In the demonstration:
    • A button for creating the array: The user can choose to randomly create an array or input an array for the program.
    • A button for starting the algorithm with the created array - show clearly each step of the sorting.
    • A back button for the user to return to the main menu at any time.

Directories

• design: Astal UML and image .png for use case & class diagram
• materials: Mindmap .xmind and image .png store for project
• submit: Report Word + Slide PowerPoint
• src: Source code
• workflow.md: GitHub WorkFlow

Branching Model

Collaborators

Name	Student ID	Email
Le Duc Anh Tuan	20204929	tuan.lda204929@sis.hust.edu.vn
Nguyen Anh Tuan	20204930	tuan.na204930@sis.hust.edu.vn
Bui Thanh Tung	20204931	tung.bt204931@sis.hust.edu.vn
Dao Van Tung	20204932	tung.dv204932@sis.hust.edu.vn