no think it is
anti-object-oriented.
Then, more once time, thank You.
2009/2/23 Luciano Pinheiro luciano@gmail.com
--
Luciano Soares Pinheiro Jr.
Analista desenvolvedor Sr.
--~--~-~--~~~---~--~~
You received
, and
number of collection.
but again i must point out, that you said that m=number of collections,
n=number of cards.so O(n.m) does not consider cards number.
2009/2/20 Luciano Pinheiro luciano@gmail.com
Very thanks Mr. Balaz.
The really situation is : I must to make a program
have card twice.
The interesting would be problem to exchange cards in way to maximize
desired cards received by all players. But this would need one player to
have card that he does not desire.
2009/2/17 Luciano Pinheiro luciano@gmail.com
I have several collections of cards (baseball
I have several collections of cards (baseball league, championship
bascketball, etc..), Where each collection C (i) is numbered from 1 to N, 1 =
i = |C|, where |C| = total number of collections that I have. I heve too many
friends, F, that I can make exchange my recurring cards with their
derised
Well,
What you need to understand is that algorithm is algorithm!
The implementation of the algorithm is only the transformation into a
programming language (Java, C, C++, etc.)..
So, you just have to understand the concept of the algorithm to
transform it into any programming
? if they are defined by enumerating its elements,
you can compute intersection in O(n) if they are sorted.
On Thu, Nov 6, 2008 at 2:32 PM, Luciano Pinheiro [EMAIL PROTECTED]
wrote:
Thank's everybody to yours answers. But, my problem is described below.
I have this problem:
In somewhere have a finite
Please, help me people !
I need understand and develop a backtracking algorithm to include into
a program and I don't nkow where find these.
Someone have any document, or URL to indicate to me ?
Sincerely,
Luciano Soares Pinheiro Jr.
Analista
Please,
Send me a copy too.
2008/6/5 Rahul Singhal [EMAIL PROTECTED]:
hey,
i also want solution
On Thu, Jun 5, 2008 at 6:11 PM, Pratyush [EMAIL PROTECTED] wrote:
Does anybody know if there is a reference manual or solutions to the
exersises to The Design of the Unix Operating Systems by
char a [n][n];
int i, j, m;
m = n/2;
if ( n % 2 == 0) m--;
for(i = 0; i = m; i++) {
for(j = 0; j = i; j++) {
a[i][j] = '*';
a[n - i - 1][j] = '*';
}
for(j = i + 1; j n; j++) {
a[i][j] = '-';
a[n - i - 1][j] = '-';
}
}
2007/3/18, BiGYaN [EMAIL PROTECTED]:
