In the statement,
i=i++ + f(i),
i++ is evaluated first. At this point i=0. The i passed to the function f()
has the value 1.
1 is printed in the function. 0 is returned. now the expression
i= i++ + f(i)
becomes
i=0+0
thus the value of i is changed to 0.
On Sat, Aug 6, 2011 at 8:29 PM, swetha rah
in case of 64 bit machine y doesn't padding happen in the 2nd structure?
On Fri, Aug 5, 2011 at 11:21 PM, hary rathor wrote:
> no ,if u r using 32 bit machine . that will use 4 byte pointer size ,
> but in 64 machine that enforce to be size of 8 . where padding will take
> int your given first
Whats the difference between the two ?
1) struct list
{
int data;
list *next;
}
and
2) struct list
{
list *next;
int data;
}
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, sen
@all : Thanks a lot for the solutions!
On Fri, Aug 5, 2011 at 10:31 PM, hary rathor wrote:
> #include
> int main ()
> {
> char str[]="hello world";
> int i,j=0,checker=0;
>
> for(i=0;i {
> int val=str[i]-'a';
>if ((checker&(1checker|=(1< }
>
> str[j]='\0';
>
>
If an additional storage is used to store the frequency / marker searching
the frequency/marker in the array would require an additional nested loop.
Would it still be O(n)?
On Fri, Aug 5, 2011 at 8:36 PM, kartik sachan wrote:
> I think in this case count sort type thing would work better way
>
>
Remove duplicate alphabets from a string and compress it in the same string.
For
example, MISSISSIPPI becomes MISP. O (n2) is not acceptable.
For this problem is it a good idea to sort the array using a sorting
technique with efficiency O(nlogn)
and remove the duplicates?
--
You received this mes
t;
>
> On Thu, Aug 4, 2011 at 6:59 PM, arvind kumar wrote:
>
>> Cos Linda and Amy are eliminated jus by seein d given conditions
>>
>>
>> On Thu, Aug 4, 2011 at 6:57 PM, priya v wrote:
>>
>>> How is the answer for the first q cindy?
>>&g
How is the answer for the first q cindy?
On Thu, Aug 4, 2011 at 5:59 PM, jestincobol nair wrote:
> @shady : logic for selecting cindy ??
> And yes Tuesday is obvious :)
>
>
> On Thu, Aug 4, 2011 at 5:47 PM, mithun bs wrote:
>
>> Ya, Tuesday is right. Quiet simple
>>
>> On Sunday both should sa
macros etc. So be prepared with these also.
>
>
> On Thu, Aug 4, 2011 at 9:21 AM, umesh kewat wrote:
>
>> Better way of using DS, able to write good algo and programming puzzles
>>
>>
>> Thanks
>> Umesh
>> MSIDC hyd
>> Sent from my Windows Phon
Microsoft's conducting campus test this saturday. Need help!
What should i concentrate on for the written round?
--
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 f
10 matches
Mail list logo