vivek01anand

there are N elements in an array. u have one number x. u have to check whether there exists two elements in that array whose sum is x. But order should be less than N^2( N square). i dont know the method how to achieve order less than n^2.

#define prn(a) printf("%d",a) #define print(a,b,c) prn(a), prn(b), prn(c) #define max(a,b) (a<b)? b:a main() { int x=1, y=2; print(max(x++,y),x,y); print(max(x++,y),x,y); } output:222342 pls explain how we get output 342 at end

hii, i have tried to install opengl in my fedora 10 but failed i want the code to install opengl please help!!!

Please, I need help in this little problem of printing all the prime numbers from to 100. Please, if you have more than one method to the question, I would really appreciate it. I also need it as soon as possible. Thanks.

hii i want c code for non preemptive scheduler where burst time and arrival time is given and u have to return waiting time from the function u will develop. please give code soon pleaseeeee..

my system has vista os the time of opening folders has increased what should i do to bring back the normal speed although i have done disk cleanup and disfragmentation please help