Re: [algogeeks] Explain this.....

i think it ll be compiler dependent becoz comma acts as a sequence pooint but not in function calls so semi colon here is a sequnce point and d value of an object (ptr here) is being modified more than once (between two seq points ) so this is undefined behavior..output will b compiler dependent

Re: [algogeeks] Re: c output

if it is undefined by standard den y dont compilers follow it On Wed, Jun 1, 2011 at 11:59 PM, Don dondod...@gmail.com wrote: That may be true, but it is not guaranteed. Having multiple side affects between sequence points is undefined by the ANSI standard. Therefore an ANSI-compliant

[algogeeks] sort the LL

The LL is in alternating ascending and descendin orders. Sort the list efficiently egs: 1-2-3-12-11-2-10-6-NULL -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe

[algogeeks] Hight of a node whose leafs are connected by DLL .. A MS question

. 10 612 4- 5 11- 13 -- |___| (I have tried my best!) Ok.. In the BST you have the leaf nodes connected to form a doubly LL. Given a node, identify its height -- You received this message because

[algogeeks] Re: Merging companies

NC2 + N-1 C2 + N-2C3 +... 2009/8/25 ankur aggarwal ankur.mast@gmail.com Merging companies Suppose we have N companies, and we want to eventually merge them into one big company. How many ways are there to merge? -- Richa Gupta (IT-BHU,India

[algogeeks] Re: Question asked in MS interview

@ Arun : I guess what ever solution you have proposed will give us the most frequantly used N words out of the whole document .As you said, getting K largest element out of total elements. Here we want , last N words in the document in the decreasing order of their occurance. 2009/8/17 richa

[algogeeks] Re: Question asked in MS interview

and if it changes then you can update list, you do not have to make more computation than is needed to redraw screen and to maintain balanced tree. 2009/8/14 richa gupta richa.cs...@gmail.com You have to develop a piece of code that can be attached to a program like Microsoft Word, which

[algogeeks] bits required to convert A to B

Given two integers A B. Determine how many bits required to convert A to B.how to write a function int BitSwapReqd(int A, int B); -- Richa Gupta (IT-BHU,India) --~--~-~--~~~---~--~~ You received this message because you are subscribed to the Google Groups

[algogeeks] Question asked in MS interview

things you would consider -- Richa Gupta (IT-BHU,India) --~--~-~--~~~---~--~~ 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 from

[algogeeks] Check divisibility by 3

can we check the divisibility of a given number by 3 withoutusing operators like '/' or '%'. I want the efficient solution to this problem .. can someone help ?? -- Richa Gupta (IT-BHU,India) --~--~-~--~~~---~--~~ You received this message because you

[algogeeks] Re: Question asked in MS interview

@ Dufus, suppose words A, B,C, D occurs at the frequacny 4, 2, 7 ,1 then the code shud be able to list it like C, A, B, D . On 2009-08-14, Dufus rahul.dev.si...@gmail.com wrote: @Arun: Did you get the job? (No offence meant) @Richa: Could you please elaborate what decreasing order means

[algogeeks] Finding repeated element in most efficient way

Hi, An array consists of all unique integers but one. The repeated element repeats in the order of two i.e. the repeated integer is 2, 4, 8, 16, etc times in the array. How to find the repeated element in most efficient way? -- Richa Gupta (IT-BHU,India

[algogeeks] Re: An interesting problem from Code4bill second round

one. On 2/1/06, srinics [EMAIL PROTECTED] wrote: How about this ?1) Set first 15 1's2) Flip 14th and 16th 2) Flip 15th and 17th...and so on The no. of flips would be:15 in step 1 +two flips each for the remaining (32767-15) cells15 + 2(32767-15)-- Richa