On Tue, Jul 31, 2012 at 7:37 PM, deepikaanand wrote:
> can anyone tell me the pattern (selection procedure )followed by directi
> this year
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To view this discussion on the web visit
> htt
ra
> > wrote:
> >
> >> .i think there will be an error in this -l value required, as post
> >> increment has more precedence than pre increment
> >>
> >>
> >> On Sun, Jul 8, 2012 at 11:44 PM, ashish jain
> >> wrote:
> >>
> >
but i am confused in this problem...
int a=10;
int b;
b=--a--;
printf("%d %d",a,b);..what will output?
On Sun, Jul 8, 2012 at 11:39 PM, md shaukat ali wrote:
> agree with adarsh
>
>
> On Sun, Jul 8, 2012 at 10:39 PM, adarsh kumar wrote:
>
>> Sorry, its 6/6 and not
agree with adarsh
On Sun, Jul 8, 2012 at 10:39 PM, adarsh kumar wrote:
> Sorry, its 6/6 and not 6/5,
>
> regds.
>
> On Sun, Jul 8, 2012 at 10:39 PM, adarsh kumar wrote:
>
>> Firstly, this is ambiguous and expressions with multiple
>> increment/decrement operators will get executed according to
nageshwar rao
On Tue, Sep 6, 2011 at 8:22 PM, Sandy wrote:
> Java How To Program - Deitel & Deitel
>
>
> On Tue, Sep 6, 2011 at 5:38 PM, htross wrote:
>
>> guys i need to prepare for java aptitude so please refer some
>> books..
>>
>> --
>> You received this message because
There can be multiple ways to do this.. obviously sorting gives you
o(nlogn).
another approach of hashtable gives o(n)
and here is another approach:
1. maintaining array of size N, initialized to 0. Say B
2. for(i=0;i= 1 , which gives unique elements
only.
Only restriction is the memory.
--~--~
If we have enough memory.. we could probably have a array to hold
values for
numbers in each base and sum it and output the value.. :) efficiency
at the cost of memory.
On Sep 25, 5:12 pm, Mgccl <[EMAIL PROTECTED]> wrote:
> is there a known, efficient digit sum algorithm exist for any base.
> In
Let me know any comments of above approach.
-MD
On Sep 5, 8:34 am, adak <[EMAIL PROTECTED]> wrote:
> Of course, the index numbers lower than the book being checked out,
> don't need to be changed, just the higher numbers.
>
> I like using an array of structs with structure
I think first s=pop() in while is not the right approach. This is an
alternate approach where explored() checks if the node is visited or
not... hence discarding that path.. and I think the following handles
the null conditions as well.. (ex given by chandra)
void postOrderTraversal(Tree *root)
