void main(int argc, char **argv) {
FILE *fin, *fout;
tree_type tree;
tree_type *Tarray;
makeNullTree(&tree);
if ((fin = fopen(argv[1], "r")) == NULL)
{
printf("Can't open file %s\n", argv[1]);
exit(1);
}
if ((fout = fopen(argv[2], "w")) == NULL)
{
printf("Can't open file %s\n", argv[2]);
exit(1);
}
Tarray = getData(fin);
tree = match(Tarray);
showArray(Tarray);
// preOrder(tree, fout, savetoFile);
inOrder(tree, display);
// freeTree(Tarray);
// freeTree(&tree);
fclose(fin);
fclose(fout);
}
int main(int argc, char ** argv)
{
NAME vals[NUM] = {
{"Mrb", "Li"},
{"Mra", "Li"},
{"Oh", "no"},
{"Oh", "aa"}
};
fputs("Random list: \n", stdout);
showArray(vals, NUM);
qsort(vals, NUM, sizeof(NAME), myComp);
fputs("\nSorted list: \n", stdout);
showArray(vals, NUM);
return EXIT_SUCCESS;
}
int main(void)
{
int primes[] = {25,3,5,7,11,13};
int *p = primes;
int size = sizeof(primes)/4; //4 is the size of a long int
showArray(p, size);
getchar();
return 0;
}
int main(){
int f;
for(i=0;i<MAX_ELEMENTS;i++){
printf("\nInserire l'elemento %d dell'array\n",f);
scanf("%d",&f);
pushIntoArray(f);
elements++;
showArray();
}
}
int main(){
int data[DATA_NUM]; //int = 1byte * 100
int i, n;
//stdlib.h
//time(NULL) グリニッチ標準時（GMT）の1970年 1月 1日の00:00:00 から 現在までが返る
srand((unsigned int) time(NULL));
//０～１００のランダムなデータを格納する
for(i = 0; i < DATA_NUM; i++){
data[i] = rand() % DATA_NUM; //randはsrandに渡したシードから疑似乱数を返す ０～DATA_NUMの範囲を返す 始まりを変更する場合はそれに加算する
}
n = insertSort(data, DATA_NUM);
showArray(data,DATA_NUM);
printf("処理回数 = %d回\n",n);
return 0;
}
void heapSort(int array[], int size) {
int heapSize = size + 1, i;
int heap[heapSize];
heap[0]=0;
for (i = 0; i < size; i++) {
heap[i + 1] = array[i];
}
for (i = heapSize / 2; i >= 1; i--) {
minHeap(heap, heapSize, i);
}
showArray(heap,heapSize);
while (heapSize > 1) {
swap(&heap[1], &heap[heapSize-1]);
minHeap(heap, heapSize, 1);
heapSize--;
}
for (i=0-1;i<size;i++){
array[i]=heap[size-i];
}
}
