banned,
trying to cheat, aye ?
no more replies on this topic, until Wednesday
On Sun, Jan 8, 2012 at 10:16 AM, kumar rajat thebossku...@gmail.com wrote:
Hi
Can any1 suggest a algo for heaviest increasing subsequence of a given
array?
(HIS is the LIS when weights are included for each element
@Lucifer : got it ..nice and clear :) :).
On Sun, Jan 8, 2012 at 10:05 AM, Lucifer sourabhd2...@gmail.com wrote:
@atul..
The table is used to record the state of subsets not print them.. (I
am assuming that's what u meant)..Hence keeping that in mind, yes it
captures all subsets... Now
isnt it is similar to finding longest subsequence , here deciding factor is
the weight of the
subsequence , so
W(old) W(new) ..update new sequence found.
On Sun, Jan 8, 2012 at 10:16 AM, kumar rajat thebossku...@gmail.com wrote:
Hi
Can any1 suggest a algo for heaviest increasing subsequence
In binary search,
mid = start + (end-start)/2 is used to avoid overflow, as said by a book.
why can't we use mid = (start + end)/2, it says this statement may result
in overflow ?
*
Sanjay Kumar
B.Tech Final Year
Department of Computer Engineering
National Institute of Technology Kurukshetra
not clear what you are trying to ask...can you quote exactly from the book?
Saurabh Singh
B.Tech (Computer Science)
MNNIT
blog:geekinessthecoolway.blogspot.com
On Sun, Jan 8, 2012 at 4:34 PM, Sanjay Rajpal srn...@gmail.com wrote:
In binary search,
mid = start + (end-start)/2 is used to
actually book pages are images.
My question is why second statement may result in overflow ?
*
Sanjay Kumar
B.Tech Final Year
Department of Computer Engineering
National Institute of Technology Kurukshetra
Kurukshetra - 136119
Haryana, India
Contact: +91-8053566286, +91-9729683720
*
On Sun,
@Sanjay: suppose Max_INT range is 300
now suppose
end=300 and start =2
now using (start+end)/2 i.e *302*/2 but 302 goes out of range for and
interger type as assumed...
but if we use start + (end-start)/2 THEN 2 + (300-2)/2 , i.e 2+ *298*/2
here 298 300 hence it within int_Max range which
@Atul : got it. thanx :)
*
Sanjay Kumar
B.Tech Final Year
Department of Computer Engineering
National Institute of Technology Kurukshetra
Kurukshetra - 136119
Haryana, India
Contact: +91-8053566286
*
On Sun, Jan 8, 2012 at 3:27 AM, atul anand atul.87fri...@gmail.com wrote:
@Sanjay: suppose
@atul:
+1, i too thought the same
this comes handly esp, when the derived datatypes are used with a range
limitations.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view this discussion on the web visit
@Deepak: Digitization of the image doesn't have a algorithmic approach,
(unless you need to compress it)
But, i see that you are asking for a way to convert the image (jpg) into a
memory representation.
I am not sure of matlab, but, using java (images API) you have to read the
data into
1 month back I wrote C++ code using Magick++ to zoom a image without
distorting the Pixels . In that Code we can extact the Pixel
attributes which are the Combination of Red , Blue and Green and Alpha
attributes(Contributes to Picture Transparancy So , not present in
Every Image ). But RBG
@All
Sry for late reply .. I was offline for sometime .
Just wanted to brief why I had come up of having a cummulative sum of
each elements of the array . As I mentioned the Frequency distribution
of the numbers ..
I meant that to the frequency the elements of the array starting from
1 to
But the Previous post is not the correct solution as it is similar to
hash table of storing the frequency counts ..
I was thinking a some Statictical Approach here . We are dealing with
some points which scattered in a space and we need to find that the
points are at same points or not . That
Given a set S, find all the maximal subsets whose sum = k. For example, if
S = {1, 2, 3, 4, 5} and k = 7
Output is: {1, 2, 3} {1, 2, 4} {1, 5} {2, 5} {3, 4}
Hint:
- Output doesn't contain any set which is a subset of other.
- If X = {1, 2, 3} is one of the solution then all the subsets of X {1}
@Piyush :
you are re-posting same problem which you had posted on 5 dec 2011.
check this link :-
http://groups.google.com/group/algogeeks/browse_thread/thread/8a58ea05c96f811b/ee74f8a4d7b68561?lnk=gstq=Maximal+possible+subsets+Algorithm#ee74f8a4d7b68561
On Mon, Jan 9, 2012 at 3:27 AM, Piyush
*#includestdio.h
int main()
{
float f=25.25;
printf(%d\n,f);
long int x=90;
printf(%f,x);
return 0;
}
*
above program gives output
*0
25.25*
shudn it be :
*25
90.*
??
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this
take care when ever you use %d and %f
%d is not flexible in handling float varibaledo not expect it to
typecast itself.
reason could be , you are trying to fit large data type i.e float to the
int whose range is less.
whereas in second case float can incorporate int type , so automatic
Hi Atul
Yes, I posted it earlier but couldn't keep track of it, thanks for the
link. I still have a doubt, does it give all the maximal subsets
or all the subsets. I couldn't get it from the algo posted by Lucifer.
On Mon, Jan 9, 2012 at 9:45 AM, atul anand atul.87fri...@gmail.com wrote:
18 matches
Mail list logo
