int main() { std::cout << "press Enter over" << std::endl; //test_merge_sort1(); //test_inversion(); testHeapSort(); //testPartitionSort(); getchar(); return 0; }
void test_sorts() { testHeapSort(); testQuickSort(); // testInsertSort(); testCountingSort(); testRadixSort(); }
int main() { testSwap(); testBuildMaxHeap(); testMaxHeapify(); testMerge(); testBubbleSort(); testSelectSort(); testInsertSort(); testMergeSort(); testHeapSort(); return 0; }
int main() { if (testIndexes()) { testBuildHeap(); testInsertHeap(); testDecreaseKey(); testExtractMin(); testHeapSort(); } int array[9] = {4,2,3,5,1,6,4,7,9}; MinHeap* myHeap = buildHeap(array, 9); printf("%d", extractMin(myHeap)); int* a = heapSort(array, 9); return 0; }