Skip to content

Latest commit

 

History

History
57 lines (43 loc) · 4.33 KB

README.md

File metadata and controls

57 lines (43 loc) · 4.33 KB

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: minh.nt204885@sis.hust.edu.vn) (L)

2. Lý Nhật Nam - 20204886 (Email: nam.ln204886@sis.hust.edu.vn)

3. Phạm Thanh Nam - 20204921 (Email: nam.pt204921@sis.hust.edu.vn)

4. Nguyễn Xuân Nam - 20200422 (Email: nam.nx200422@sis.hust.edu.vn)


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/