No one has voted on any posts yet. Votes from other community members are used to determine a member's reputation amongst their peers.
|
Where can i download the various header files for dev c? sys/types.h sys/socket.h netinet/in.h arpa/inet.h and also structure sockadder and it's derivatives
|
|
|
How can we find a sub array in a 1-D array? Is there any other method other than brute force method? It is not for maximum sum so we can't use kadane's algorithm.
|
|
|
How can we calculate whether a number is a power of 2 or not in a single statement without using a loop? All the ones that I can think of use loops or don't satisfy the condition. for eg. The use of XOR doesn't work as it gives incorrect input. … 
|
|
|
Please enclose code or link for implementation of monte carlo methods. Thanks in advance 
|
|
|
I have a code like [code] int a=10; a=(++a)+(a++)+(a++)+(a--)+(--a); printf("%d",a); [/code] this gives the output as 51. while [code] printf("%d",(++a)+(a++)+(a++)+(a--)+(--a)); [/code] gives 56 as ouput. can you please explain the flow in both the statements.
|