static void merge(int *a, int *b, int start, int end) { int mid = (start+end)/2; int i=start, j=mid+1, k=start; while (i<=mid && j<=end) { if (a[j] >= a[i]) { b[k++] = a[i++]; } else { b[k++] = a[j++]; } } while (i<=mid) { b[k++] = a[i++]; } while (j<=end) { b[k++] = a[j++]; } for (i=start; i<=end; i++) { a[i] = b[i]; } my_print2(a, start, end); }
int main() { uval.a = 10; printf("v.a = %d, v.b = %d\n", uval.a, uval.b); return 0; double eps = 1e-8; double cella2 = 0.176; double pixel = 0.028; double cella2p = cella2 / ceil((cella2 - eps) / pixel); TRACE(cella2p, %f); int cella2n = (int)rint(cella2 / cella2p); TRACE(cella2n, %d); int ia = 10; TRACE(ia, %d); printf("size of one char in c:%d\n", sizeof('a')); char a = -127; printf("%#x\n", a); unsigned char i = -1; printf("%#x\n", i); printf("%d\n", i%256); return 0; char my_string[] = "hello there"; my_print(my_string); my_print2(my_string); }
main () { char my_string[] = "hello there"; my_print (my_string); my_print2 (my_string); }
void fast_sort(int *a, int start, int end) { int i, j, key, temp; if (start >= end) { return; } key = a[start]; i = start; j = end; while (i<j) { while (j>i) { if (a[j] < key) break; j--; } while (i<j) { if (a[i] > key) break; i++; } if (i != j) { temp = a[i]; a[i] = a[j]; a[j] = temp; } } a[start] = a[i]; a[i] = key; fast_sort(a, start, i-1); fast_sort(a, i+1, end); my_print2(a, start, end); }
main() { char my_string[]="hello world!\n"; my_print(my_string); my_print2(my_string); }