Dear friends.
I´m starting a paper about making change problem. It´s must envolve
greedy e dynamic programming.
What´s the origins of change problem? Where can I find cientific
resources about this subject.
Thaks in advance.
Allysson
--~--~-~--~~~---~--~~
Hi
On Nov 22, 8:26 pm, Sherry [EMAIL PROTECTED] wrote:
I know how the complexity of an algorithms is calculated, but how
would this relate to the time it takes? Let's say I have 25000 random
numbers I'd like to sort with the selection sort. Now how could I use
Big O notation to calculate
-
Be a better sports nut! Let your teams follow you with Yahoo Mobile. Try it now.
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this
Hi
I got the answer. Correcting the program as we need to add a condition
to take care of -ve values
Please correct me if I am wrong
int i = 0;
int nPair
while (in)
{
nPair = X - array[i];
if(nPair = 0)
continue;
else if(bitmap[nPair] == marked)
printf(found the
Are you guys oblivious to the existence of a hashmap data structure?
On Nov 26, 2007 12:15 AM, MJ [EMAIL PROTECTED] wrote:
Hi
I got the answer. Correcting the program as we need to add a condition
to take care of -ve values
Please correct me if I am wrong
int i = 0;
int nPair
while (in)
