int
libcall_print(id_item_t **args, int *rettypes, void **retvals)
{
id_item_t *current;
str_t *str;
struct variable *var;
assert(args != NULL && args[0] != NULL);
current = args[0];
switch (current->type) {
case ID_VAR:
var = current->var;
str = var_cast_to_str(var);
printf("%s\n", str_ptr(str));
break;
case ID_ARR:
arr_print(current->arr);
break;
default:
error(1, "something wrong\n");
}
rettypes[0] = ID_UNKNOWN;
retvals[0] = NULL;
return 0;
}
int main(void)
{
const int sz = 100;
int i;
int arr[sz];
int last = 0;
srand(time(NULL));
for (i=0; i<sz; i++) {
arr[i] = last + rand()%10;
last = arr[i];
}
// arr_print(arr, sz);
/*
i = my_bsearch_norecursive(arr, sz, rand() % (arr[sz - 1] + 1) );
if (i < 0)
printf("smula\n");
else
printf("found at %d\n", i);
*/
i = test_search(arr, sz, rand() % (arr[sz - 1] + 1));
/* missmatch */
if (i == 0) {
arr_print(arr, sz);
return 1;
}
return 0;
}
int main() {
BTreeNode *root = NULL;
int collection[] = { 10, 20, 40, 30, 100, 110, 90, 35 };
for (unsigned long i = 0;
i < sizeof(collection)/sizeof(collection[0]);
i++) {
bt_add_to_list_sorted(&root, collection[i]);
}
// bt_print_list_in_order(root);
int size = 0;
// now we will put the tree into the array
int *array = bt_to_array(root, &size);
// print its contents to check everything is working
for (int i = 0; i < size; i++) {
printf("%d ", *(array + i));
}
printf("\n");
quicksort(array, 0, size);
arr_print(array, size);
}
// for(int i = 0; i <= last; i++){
// arr[i] = buf[i];
// }
// }
int main(){
int arr[10] = {1,2,54,2,3423,432,546,13,23,54};
int buf[10];
merge_sort(arr,0,9,buf);
arr_print(buf, 10);
return 0;
}
int main() {
int arr[10] = { 2,1,8,9,3,6,55,4,40 };
int brr[10];
merge_sort(arr, 0, 9, brr);
arr_print(brr);
// int len;
// int arr[1000000];
// int brr[1000000];
// scanf("%d", &len);
// for(int i = 0; i < len; i++){
// scanf("%d", &arr[i]);
// }
// merge_sort(arr,0, len-1, brr);
// for(int i = 0; i < len; i++){
// printf("%d\n", brr[i]);
// }
}
