@Gene
I think there is some mistake in this programe.
when the input is :
a[ ] = {30,25,19,16}
b[ ] = {20,18,14,10}
the right result should be 30+20, 30+18, 25+20,30+14
but the output of your programe is 30+20,30+18,25+20,25+18
Best Regards!
2010/5/4 Gene gene.ress...@gmail.com
I propose
i think ,you can use the idea of merg (merg sort)
--- On Mon, 7/19/10, manish bhatia mb_mani...@yahoo.com wrote:
From: manish bhatia mb_mani...@yahoo.com
Subject: Re: [algogeeks] a google question
To: algogeeks@googlegroups.com
Date: Monday, July 19, 2010, 5:03 PM
Given two sorted postive
Nice way to put it erappy, here is another way.
A block of length L can be place at the corner of the outer square
such that it makes a triangle so that two sides of the triangle is the
corner sides of the square and the base of the triangle is the block.
Now, on this block another block can be
step :
1. Sorting LBH in decreasing order first on L than on B and than on H
.
2. Now find longest decreasing sub-sequence of array of structures(LBH) .
correct me if I m wrong !!!
On Sun, Jul 18, 2010 at 11:44 PM, amit amitjaspal...@gmail.com wrote:
Given a lot of cuboid boxes with
Can you write some pseudo-code for your algorithm?
I think it has a problem with how-much-time-to-wait-in-one-lane.
For example, there are two lanes and cars are coming as:
lane1 10 5 4 3 2 1
lane2 9 6 3
So, the times when the car is not there will be:
lane1 9 8 7 6
lane2 10 8 7 5 4 2 1
Given two text strings A of length n and B of length m, you want to
transform A into B with a minimum number of operations of the following
types: delete a character from A, insert a character into A, or change some
character in A into a new character. The minimal number of such operations
http://codepad.org/QSaNaQlH
On Mon, Jul 19, 2010 at 10:29 PM, Anand anandut2...@gmail.com wrote:
Given two text strings A of length n and B of length m, you want to
transform A into B with a minimum number of operations of the following
types: delete a character from A, insert a character
