Description: Sorting by Heapsort and Mergesort algorithms. =================================== Input file: H01dat.txt--------------------------- nab the second column contains the first column after the a1 a2 a3 a4 ...... an n: to the number of input data sorted. ai: to sort the data, separated by space or newline, the program must be able to judge for themselves the information input to the n pen up.------------------------------------- Output: standard output < that is output to the screen> ------------------------------------ a: if a = 1, using the heapsort if a = 2, using mergesort. b: If b = 1, then display the results sorted < steeled> if b = 2 and a = 1, the output Heapsort during the last two (including Heapify process) if a = b = 2 and 2, Megersort sort the output process of the previous five.
To Search:
File list (Check if you may need any files):
HeapMergeSort\HeapMergeSort\H01dat.txt
.............\.............\HeapMergeSort.cpp
.............\.............\HeapMergeSort.exe
.............\HeapMergeSort
.............\HeapMergeSort_README.txt
HeapMergeSort
Download