Description: 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.
To Search:
- [IMAGE_TRACE] - C++ BUILDER under the bitmap image of th
- [minesweeping] - To resolve the issue of demining. To ach
- [C++] - College school system, including seven f
- [chazhaopaixudeyingyong] - Data structure on the search, sorting ap
- [students] - C++ Prepared student information managem
File list (Check if you may need any files):
Download