void evalute_along_number_of_elements(int _num_) { Heap h; Init_Heap(&h, _num_); int i; int *for_insertion, *for_bubble, *for_selection; for_insertion = (int*)malloc(sizeof(int)*_num_); for_bubble = (int*)malloc(sizeof(int)*_num_); for_selection = (int*)malloc(sizeof(int)*_num_); /// generating for(i=0;i<_num_;i++) { for_insertion[i] = for_bubble[i] = for_selection[i] = randomNum[_num_/10000][i+1]; } for(i=1;i<=_num_;i++) { Insert_Heap(&h, randomNum[_num_/10000][i]); } /// printing printf("%d elements\n", _num_); printf("Insertion sort : "); EvaluateProcessTimes(for_insertion, _num_, InsertionSort); printf(" Bubble sort : "); EvaluateProcessTimes(for_bubble, _num_, BubbleSort); printf("Selection sort : "); EvaluateProcessTimes(for_selection, _num_, SelectionSort); printf(" Heap sort : "); EvaluateProcessTimes(h.heap, h._heap_size_, HeapSort); puts(""); // for margine /// deletion free(for_insertion); free(for_bubble); free(for_selection); Delete_Heap(&h); }
void Init_Everything () { Init_Type (); Init_Cstring (); Init_String (); Init_Symbol (); Init_Env (); Init_Error (); Init_Exception (); Init_Io (); Init_Prim (); Init_Math (); Init_Print (); Init_Auto (); Init_Heap (); Init_Load (); Init_Proc (); Init_Special (); Init_Read (); Init_Features (); Init_Terminate (); #ifdef CAN_DUMP Init_Dump (); #endif }