Take a look on the Ford-Fulkerson algorithm.
-- Barata
--~--~-~--~~~---~--~~
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
What if this happens?
MinPhiBla MinThetaBla MinZuhaBla
Should it be: {P,T,Zu}, {i,eta,a} ?
-- Flávio Santos
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send
If you don't have complexity restrictions... you can solve this using
back-tracking.
I can imagine a solution with dynamic programming as well.
-- flavio
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
Algorithm
Linear time??
How?? :-)
Can you figure this out?
-- flavio
Arun wrote:
sort A and B seperately - O(nlgn)..
add A[i]and B[i] - O(n)
so, O(nlgn) .
linear time maybe possible.
On 8/25/06, Amal [EMAIL PROTECTED] wrote:
There are 2 arrays say array A and array B given whose size is
Hi,
I'm interested!!
And, I've coded a Minespweeper a few months ago.
Let me know if you are interested on it!
Flávio
JeffCameron wrote:
I was counting on writing the minesweeper client myself. It will query
your programs for one move at a time until the board is done, or a mine
is
