static void timer() {
int i;
for (i = 10000000; i < 1000000001; i *= 2) {
int size = sizeof(int) * i;
int *data = malloc(size);
if (data == NULL ) {
fatal("data malloc failed.");
}
random3(data, i,0,i);
mergeSort(data, i);
free(data);
// printf("\n");
}
}
/* BEGIN TEMPLATE */
void run() {
// Your code here =)
/* BEGIN SOLUTION */
while (!isOverBaggle()) {
switch(random3()) {
case 0:
if (!isFacingWall()){
forward(1);
}
break;
case 1:
left();
break;
case 2:
right();
break;
}
}
//pickupBaggle();
/* END SOLUTION */
}
static void test() {
typedef void (*sort)(int *, int n);
sort sorts[] = { quicksort1, quicksort2, quicksort3, quicksort4, quicksort5,
quicksort6, quicksort7 };
int num = 7;
int i;
int n = 10;
int data[n];
// random(data, n);
random3(data, n, 0, n - 1);
printf("Input Data: ");
printArray(data, n);
int tmp[n];
for (i = 0; i < num; i++) {
memcpy(tmp, data, n * sizeof(int));
sorts[i](tmp, n);
printf("QuickSort%d: ", i + 1);
printArray(tmp, n);
memset(tmp, 0, n * sizeof(int));
}
printf("--------------------\n");
}
