@atul007: When you mean n^2 solution.. did you mean the DP which actually
is 2^n??
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To view this discussion on the web visit
https://groups.google.com/d/msg/algogeeks/-/MrOfjqZKk8YJ.
To post to
@shady , prakash : we have to find all combination , not one so could you
providelittle more explanation by using 0-1 knapsack.
@ sravanreddy001: yeah it should be O(2^n).
On Fri, Jan 6, 2012 at 8:07 PM, sravanreddy001 wrote:
> @atul007: When you mean n^2 solution.. did you mean the DP which
-- Forwarded message --
From: Pradeep
Date: Fri, Jan 6, 2012 at 8:34 PM
Subject: [cse_hbatch2009] Friends - Play the online treasure hunt of
Abacus12
To: cse_hbatch2...@yahoogroups.co.in
**
What makes your body temperature to shoot up? What makes your brain dance
up and down? Y
@ The following link might help..
http://groups.google.com/group/algogeeks/browse_thread/thread/8a58ea05c96f811b?hl=en#
Basicaly if A[N, Wmax] = 1, then find all subsets using backtracking..
where,
N = no. of elements,
Wmax = 4...
On Jan 6, 7:50 pm, atul anand wrote:
> @shady , prakash : we hav
@atul007: the 0-1 knapsack is a special case of subset sum problem, (and..
i don't think its easy to find all the solutions using 0/1 knapsack.. )
@shady: is it possible?
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To view this discuss
@dabbcomputers: looking at the worstcase, listing all points in the set
itself takes O(n) time,
just to speed up the time would be sort all the points(x,y) wrt x-values &
another with sorting on y-values,
and restrict the target solution space to (x +(or)- R) & (y +(or)- R) and
work on those
@arun: http://mindprod.com/jgloss/immutable.html
this might help you, in essense, if a compiler treats them as immutable,
the reason is to reduce the overhead of creating another contant literal
(as explain at the link, the string literals are the most commonly used)
this is from a java (or hig
Wat is the use of ## in define??
#include
#define f(g,g2) g##g2
void main()
{
int var12 =100;
printf("%d",f(var,12));
}
o/p :100
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To view this discussion on the web visit
https://groups.g
it joins the variables together ... for eg 1##2 = 12
--
*Parag Khanna
B.tech Final Year
NIT,Kurukshetra*
--
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 fro
On Sat, Jan 7, 2012 at 12:36 AM, parag khanna wrote:
>
> it joins the variables together ... for eg 1##2 = 12 or a##b=ab
>
>
>
>
>
>
> --
> *Parag Khanna
> B.tech Final Year
> NIT,Kurukshetra*
>
--
*Parag Khanna
B.tech Final Year
NIT,Kurukshetra*
--
You received this message because you ar
when ever you need to calculate values or solve a equations,apply discrete
mathematics
like newton raphson method it coverges very fast.
On Thu, Jan 5, 2012 at 3:50 PM, WgpShashank wrote:
> you may also like it , explained two algorithm , discussed about
> complexities , let me know if anything wr
Given an array A[n], start by sorting the array.
Then do something like this:
int result[n];
int size=0;
void findSubset(int sum, int position=0)
{
if (sum == 0) output(result, size);
for(int i = position; i < n; ++i)
{
if (A[i] > sum) break;
result[size++] = A[i];
@parag thnx...
btw is dere ny source dat has ny info bout it??
Regards,
Payal Gupta,
3rd year,
NIT-Bhopal
On Sat, Jan 7, 2012 at 12:36 AM, parag khanna wrote:
>
>
> On Sat, Jan 7, 2012 at 12:36 AM, parag khanna wrote:
>
>>
>> it joins the variables together ... for eg 1##2 = 12 or a##b=ab
>>
>
>
Given an array A[n], start by sorting the array.
Then do something like this:
int result[n];
int size=0;
void findSubset(int sum, int position=0)
{
if (sum == 0) output(result, size);
for(int i = position; i < n; ++i)
{
if (A[i] > sum) break;
result[size++] = A[i];
@all Yes it is possible to find the solution using 0/1 knapsack.The
approach would be similar as in case of LCS problem when many LCS are
possible.Though the implementation could be a bit difficult.For each
subproblem when the choice of dubproblems become equally beneficial start a
new thread w
yes payal read a standard c book like dennis ritchie ... these are the
best source
On Sat, Jan 7, 2012 at 1:53 AM, payal gupta wrote:
> @parag thnx...
> btw is dere ny source dat has ny info bout it??
>
> Regards,
> Payal Gupta,
> 3rd year,
> NIT-Bhopal
>
>
> On Sat, Jan 7, 2012 at 12:36 AM,
## concatenating operator
On Sat, Jan 7, 2012 at 9:01 AM, UTKARSH SRIVASTAV
wrote:
> yes payal read a standard c book like dennis ritchie ... these are the
> best source
>
>
> On Sat, Jan 7, 2012 at 1:53 AM, payal gupta wrote:
>
>> @parag thnx...
>> btw is dere ny source dat has ny info
@utkarsh n tejbala ...thnx..4 d info.
Regards,
Payal gupta,
3rd year,cse,
NIT-Bhopal
On Sat, Jan 7, 2012 at 9:30 AM, teja bala wrote:
> ## concatenating operator
>
>
> On Sat, Jan 7, 2012 at 9:01 AM, UTKARSH SRIVASTAV > wrote:
>
>> yes payal read a standard c book like dennis ritchie
18 matches
Mail list logo
