mirror of
https://github.com/caperren/school_archives.git
synced 2025-11-09 13:41:13 +00:00
75 lines
1.8 KiB
C
75 lines
1.8 KiB
C
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <assert.h>
|
|
#include <string.h>
|
|
#include "dynamicArray.h"
|
|
#include "toDoList.h"
|
|
|
|
/* NOTE: Switch between TESTSORT and TESTHEAP to test either the heap sort algoritm or the heap operations*/
|
|
#define TESTHEAP
|
|
|
|
int main(int argc, const char * argv[])
|
|
{
|
|
Task *task1, *task2, *task3, *task4, *task5, *task6, *task7, *task8, *task9, *task10;
|
|
DynArr *mainList;
|
|
int i;
|
|
mainList = createDynArr(10);
|
|
|
|
/* create tasks */
|
|
task1 = createTask(9, "task 1");
|
|
task2 = createTask(3, "task 2");
|
|
task3 = createTask(2, "task 3");
|
|
task4 = createTask(4, "task 4");
|
|
task5 = createTask(5, "task 5");
|
|
task6 = createTask(7, "task 6");
|
|
task7 = createTask(8, "task 7");
|
|
task8 = createTask(6, "task 8");
|
|
task9 = createTask(1, "task 9");
|
|
task10 = createTask(0, "task 10");
|
|
|
|
/* add tasks to the dynamic array */
|
|
addHeap(mainList, task1);
|
|
addHeap(mainList, task2);
|
|
addHeap(mainList, task3);
|
|
addHeap(mainList, task4);
|
|
addHeap(mainList, task5);
|
|
addHeap(mainList, task6);
|
|
addHeap(mainList, task7);
|
|
addHeap(mainList, task8);
|
|
addHeap(mainList, task9);
|
|
addHeap(mainList, task10);
|
|
|
|
#ifdef TESTHEAP
|
|
for(i = 0; i < sizeDynArr(mainList);i++)
|
|
printf("DynArr[%d] = %d\n", i, ((Task*)getDynArr(mainList,i))->priority);
|
|
|
|
|
|
while(!isEmptyDynArr(mainList))
|
|
{
|
|
Task* v;
|
|
v = getMinHeap(mainList);
|
|
printf("Val = %s___%d\n", v->description, v->priority);
|
|
removeMinHeap(mainList);
|
|
}
|
|
#endif
|
|
|
|
#ifdef TESTSORT
|
|
|
|
printf("Before Sort Called \n");
|
|
for(i = 0; i < sizeDynArr(mainList);i++)
|
|
printf("DynArr[%d] = %d\n", i, ((Task*)getDynArr(mainList,i))->priority);
|
|
|
|
|
|
/* sort tasks */
|
|
sortHeap(mainList);
|
|
printf("After Sort Called \n");
|
|
|
|
/* print sorted tasks from the dynamic array */
|
|
for(i = 0; i < sizeDynArr(mainList);i++)
|
|
printf("DynArr[%d] = %d\n", i, ((Task*)getDynArr(mainList,i))->priority);
|
|
|
|
return 0;
|
|
|
|
#endif
|
|
}
|