It COULD BE a knapsack problem, but it SHOULDN'T be a knapsack problem.
Not with a full database!
As to my intelligence - I'm no genius. Despite all claims to the
contrary, few are. Fortunately, you don't have to be a genius to code
up a database. Just kinda bright and willing to work. I didn't m
vim wrote:
> Is best worst and average case same for selection sort?
> Tell me whether the time complexity depends on the basic steps.
> plz plz plz
Selection sort is order independent, meaning it'll take the same amount
of time regardless of the starting order. That should be enough
information
pero wrote:
> Learn C programming from these daily lessons I found. They're eleven
> days ahead of you already so get busy...
>
> http://www.visualcmaniac.com
I wouldn't try to learn C from those lessons. They're poorly
structured, poorly ordered, and filled with bad examples.
--~--~-~
Learn C programming from these daily lessons I found. They're eleven
days ahead of you already so get busy...
http://www.visualcmaniac.com
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
T
First things first, Your signature line doesnt go with wrong naming of
state.
Secondly, how is this relevant to the group.
Narender
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post
On 3/3/06, adak <[EMAIL PROTECTED]> wrote:
>
> No offense, but you're quite mad!
No offense, but you're quite stupid.
> This is a database - not a knapsack problem.
You completely failed to understand the problem. It is indeed a
knapsack problem, read it many times until you understand.
--~--
