My team works to easily master the sorting algorithm: quick sort & insertion sort, using Unity3D development tools to complete the production. This work aims to help students better understand the sorting algorithm in the quick sort and insertion sort. This work designs several modules such as algorithm principle, fixed number sorting, random number sorting and user-defined sorting. Through voice explanation, algorithm execution process simulation is carried out according to fixed number sorting, random number sorting and user input data, which helps students learn and master sorting algorithm better step by step, and compares random number sorting through quick sorting VS insertion sorting module, the form of PK visually compares the execution process and execution efficiency of the two algorithms. The characteristics of this work are: the abstract sorting algorithm visualization, visualization, can make the beginner algorithm easy to understand the sorting algorithm, in which we can input data to insert sort and quick sort simulation, the upper left corner of the interface pseudo-code can assist students to understand. After discussion by team members, the entry point for making algorithm courseware is determined. Students believe that the abstraction of the algorithm is a major obstacle to learning algorithms, in general, we can only indirectly understand the function and implementation of the algorithm through the explanation in the book and the code entered on the computer. So the team decided to use the algorithm process simulation and interaction to demonstrate the algorithm execution logic. We chose two most representative algorithms: quick sort and insertion sort. And through six modules, step by step to help students master these two sorting algorithms. At the same time, an exercise refinement module is added, with three classroom exercises to help teachers understand the learning effect of students and find the weak points of knowledge mastery, so as to carry out follow-up teaching in a more targeted manner.