Re: [algogeeks] problem of fork()

2012-05-24 Thread sumit mahamuni
options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- Thanks and Regards, Sumit Mahamuni. -- So once you do know what the question actually is, you'll know what the answer means. -- Perhaps the most important principal for good algorithm designer is to refuse

Re: [algogeeks] C concept on memory layout

2012-02-06 Thread sumit mahamuni
Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- Thanks and Regards, Sumit Mahamuni

Re: [algogeeks] Re: Find even length palindrome.

2011-12-28 Thread sumit mahamuni
do so by storing // pStrt in a variable.. Using the currMax and pStrt you can get the // exact palindrome.. } } else X[pStrt] = 0; } pRev -- ; } On Dec 28, 10:57 am, sumit mahamuni sumit143smail...@gmail.com

Re: [algogeeks] Re: Find even length palindrome.

2011-12-28 Thread sumit mahamuni
email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- Thanks and Regards, Sumit Mahamuni. -- Slow code that scales better can be faster than fast code that doesn't scale! -- Tough times never lasts

Re: [algogeeks] Find even length palindrome.

2011-12-27 Thread sumit mahamuni
://groups.google.com/group/algogeeks?hl=en. -- Thanks and Regards, Sumit Mahamuni. -- Slow code that scales better can be faster than fast code that doesn't scale! -- Tough times never lasts, but tough people do. -- I love deadlines. I like the whooshing sound they make as they fly by. - D

Re: [algogeeks] Cliched 'k' largest elements in billion numbers: Heaps or median-of-medians?

2011-12-11 Thread sumit mahamuni
options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- Thanks and Regards, Sumit Mahamuni. -- Slow code that scales better can be faster than fast code that doesn't scale! -- Tough times never lasts, but tough people do. -- I love deadlines. I like the whooshing sound

Re: [algogeeks] Re: An Array Problem

2011-11-24 Thread sumit mahamuni
to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- Thanks and Regards, Sumit Mahamuni. -- Slow code that scales better can be faster than fast code that doesn't scale! -- Tough times never lasts, but tough people do

[algogeeks] Re: Re-entrant and thread safe

2011-11-17 Thread sumit mahamuni
On Oct 29, 10:44 pm, AMAN AGARWAL mnnit.a...@gmail.com wrote: Hi All, Please explain the difference between thread safe functions and re-entrant functions with example. Thread safe function is the function if it ensures that it is the only thread which modifies the shared data structure in

Re: [algogeeks] Re: DS Q

2011-11-17 Thread sumit mahamuni
. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- Thanks and Regards, Sumit Mahamuni. -- Slow code that scales better can be faster than fast code that doesn't scale

[algogeeks] Re: heap memory

2011-11-14 Thread sumit mahamuni
On Nov 5, 10:28 pm, himanshu kansal himanshukansal...@gmail.com wrote: can we know the size of heap memory allocated to our program Hi, from my knowledge of OS, when program is loaded in the memory the heap is not allocated to the process. as the requests made by the process, the

Re: [algogeeks] LCA of a Binary tree not a binary search tree

2011-11-14 Thread sumit mahamuni
the root node, but no such constraint is applicable for a binary tree. Regards, Aman. On Mon, Nov 14, 2011 at 10:12 AM, sumit mahamuni sumit143smail...@gmail.com wrote: Hi, On Mon, Nov 14, 2011 at 1:52 AM, AMAN AGARWAL mnnit.a...@gmail.comwrote: Hi, Please tell me the solution

[algogeeks] Re: free() function

2011-11-13 Thread sumit mahamuni
On Nov 11, 9:16 pm, saurabh singh saurab...@gmail.com wrote: well that would be tough for the compiler to predict things that will happen during run time.Its the job of garbage collector to do that. well compiler cant predict what will happen at runtime. On Fri, Nov 11, 2011 at 8:36

Re: [algogeeks] difference btw int *a[] and int (*a)[]

2011-11-13 Thread sumit mahamuni
and Regards, Sumit Mahamuni. -- Slow code that scales better can be faster than fast code that doesn't scale! -- Tough times never lasts, but tough people do. -- I love deadlines. I like the whooshing sound they make as they fly by. - D. Adams -- You received this message because you are subscribed

Re: [algogeeks] difference btw int *a[] and int (*a)[]

2011-11-13 Thread sumit mahamuni
. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- Thanks and Regards, Sumit Mahamuni. -- Slow code