Simple Student Information Management System program ideas: the first element to create a student class, students used to store various data. And then create a stack (heap) type, the data in order to stack the form of storage, can be carried out and various operation HEAPSORT. Finally, re-use a class (class priQueue) type of packaging the heap in order to facilitate the main function call. Comparison of this procedure is the core technology used in the heap sort students by priority (high in front of the row, low row behind) the size of orderly arrangement. HEAPSORT time complexity of a more general sort (eg: bubble, choose, etc.) too low, the procedure can show the data more efficient.

简易学生信息管理系统
....................\学生信息管理系统.cpp
....................\学生信息管理系统.exe
....................\计算机系课程设计报告.doc

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．