For me, the easiest way to accomplish this is to have a "reader" index
and a "writer" index. At each iteration, increment the reader. If
the character at the position of the reader is NOT in the pattern,
then write that character to the writer position and increment the
writer.
i.e.
int len=st
Find Your Programming Job Vacancy and resources here -->
http://www.jobbankdata.com/job-programming.htm
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to a
;t uses minimum number of cars, we need algorithm to
allocate in minimum number of cars.
On Oct 30, 10:26 am, Arunachalam <[EMAIL PROTECTED]> wrote:
> Can you put some more light on the problem by giving some more examples ?
>
> On 10/30/06, Joe <[EMAIL PROTECTED]> wrote:
>
Give an Optimal Allocation Algorithm for the described problem:
Given 'n' riders of varying weight, they should be allocated to cars
and a car can be allocated 0<=M weight. Algorithm to allocate the
riders in minimum number of cars.
--~--~-~--~~~---~--~~
You rece
Hi,
In a sequence o,f from 1 to n (1,2,3,...n) numbers, we need to find the
missing numbers. There will not be duplicates.
Can you please suggest an algorithm.
Thanks,
Joe.
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google
