Skip to content

An application that explains three sorting algorithms on an array: Merge sort, counting sort and radix sort.

License

Notifications You must be signed in to change notification settings

minhngt62/OOP.DSAI.20212.16

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

OOP.DSAI.20212.16

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.

Topic: Demonstration of sorting algorithms on an array


Assignment of members

1. Nguyễn Tống Minh - 20204885 (Email: [email protected]) (L)

2. Lý Nhật Nam - 20204886 (Email: [email protected])

3. Phạm Thanh Nam - 20204921 (Email: [email protected])

4. Nguyễn Xuân Nam - 20200422 (Email: [email protected])


Project video demo

bandicam.2022-07-13.22-21-47-579.mp4

Inspiration

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