这是我收到的一个示例问题。
You are given files containing templates for a StackType, a QueueType, and a
BinarySearchTreeType. There is also a file called Record.h that holds the
declarations and definitions for a Record class that contains information about a
student. All function bodies are given except for the overloading of the
operators “<” and “>”.
Write a main program, sort.cpp, that takes a squential binary file called
Student.dat that contains records of the given class, then prints it out ordered
by student ID. You may use all or none of the templates given to you.
我不完全确定这是在问什么。最快和最简单的方法是什么？我认为最简单或最快的方法是应用快速排序或合并排序。您能否发布一些示例代码。