I got some other outputs.. when line 6 isn't commented i got 3 1 2 3, i m
using turbo c++ compiler..
On Fri, Dec 6, 2013 at 8:17 AM, pawan yadav pawan1991ya...@gmail.comwrote:
Hi All,
I'm not able to get output of following c program :
#includestdio.h
main()
{
int a[] ={
i think because of operator the program is working differently... also
there is four data value print operation..
On Mon, Dec 9, 2013 at 2:34 AM, Tamanna Afroze afroze...@gmail.com wrote:
I got some other outputs.. when line 6 isn't commented i got 3 1 2 3, i m
using turbo c++ compiler
both codes are same. Where is the difference?
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
sorry for my last post, i didn't look carefully at the code. I think
without bracket the ternary expression is incomplete, that's why; first
code doesn't compile correctly.
On Wed, Oct 31, 2012 at 9:51 AM, Tamanna Afroze afroze...@gmail.com wrote:
both codes are same. Where is the difference
I think heredity(bird,X)- can(bird,X), have (bird,X), subclass(bird,X).
On Sat, Oct 20, 2012 at 3:06 AM, Victor Manuel Grijalva Altamirano
kavic1.mar...@gmail.com wrote:
Hi, i am new programming with prolog, i hav the next sentence...
can(bird,fly).
have(bird,wings).
subclass(bird,animal).
how?
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
This is really an interesting problem. If it is searched from the left to
right the most possible subset is 7 and for the 8th number we have to track
from right to left.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group,
This problem is very old and O(NlgN) may be the best runtime .
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
as the array is sorted binary search is the best option...
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
if(matrix[i][j]==0){
for(int j=0;jn;j++)
matrix[i][j]=0;
}
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
The code is already optimized...
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more
nice link:: @shady
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit
haveFactor() function checked the factor of a number.
if a number has a factor other than 1 and itself it isn't prime.
Operation function does the rest of the thing, i.e. file reading and file
writing and looping throgh the file's input.
Does that make sense?
Pz let me know.
--
You received
I checked whether th enuber s divisible by 2 nd 3 repeatedly...
I got no other number which aren't divisible by these two numbers.
nd I am done.
Tht's all abhinav.
Tamanna
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group,
Thanks to all for the nice suggestions. thanks @abhianv and @siddhart.
I will try all the suggestions..
Tamanna
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe
@abhinav I think time complexity will be higher for that algorithm
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
couldn't understand the problem
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more
*If you are on a boat and you throw out a suitcase, Will the level of water
increase.*
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email
yah the ans is 3
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit
P+Q = -R
(P+Q)3 = -R3
P3+Q3+3PQ(P+Q) = -R3
P3+Q3+R3 = =3PQ(P+Q)
P3+Q3+R3 = 3PQR
NOW,
P2/QR+Q2/PR+R2/PQ=(P3+Q3+R3)PQR = 3
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To
I think C++ has some advanced feature for memory allocation like new.
On Wed, Jul 6, 2011 at 6:34 PM, Piyush Sinha ecstasy.piy...@gmail.comwrote:
Why is it suggested not to use malloc() or calloc() in C++ for memory
allocation?
--
*Piyush Sinha*
*IIIT, Allahabad*
*+91-8792136657*
Hi All,
This group is very active and useful. Very useful to shre information
related to algorithms, its problem and solution.
--
Best Regards,
*Tamanna Afroze*
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send
at
http://groups.google.com/group/algogeeks?hl=en.
--
Best Regards,
*Tamanna Afroze*
*Linux Developer***
*EXLING LLC***
[image: logo]
*House 3G, Road No 104,
Suite B4, Gulshan 2,
Dhaka - 1212,
Bangladesh.***
*Direct Cell: (880) 1711-059642
Tel: (8802)-881-8687
Fax: (8802)-881-8688
23 matches
Mail list logo
