main() { int *p,*q,i; p=(int *)100; q=(int *)200; i=q-p; printf("%d",i); } it is getting output 50 in turbo c compiler.I do not know how...
o/p will be same as you give the input in the array.
int DIMension(int array[]){ return sizeof(array/sizeof(int);} main(){ int arr[10]; printf(“Array dimension is %d”,DIMension(arr)); }
thanks alot...
main(){ int i = 10, j =20; j = i ,j?(i,j)?i :j:j; printf(“%d\n%d”,i,j); } the answer is 10 10
but i want it with least complexity like O(n)...
Q:-find the all possible combination of digits ranging 1 to 9 whose sum is 10, no digit should be repeated in any combination. e.g: 1234 127...
Separate names with a comma.
