"Hello" will be printed 45 times...
On Wed, Sep 21, 2011 at 7:57 PM, sush57 wrote:
> main()
> {
>int tmp;
>for(i=0;i<9;i++)
>{
>tmp=fork();
>if(tmp>0)
>break;
>printf("Hello");
>}
> }
>
>
> wh
+1 to Dave...
On Mon, Sep 19, 2011 at 8:34 AM, sukran dhawan wrote:
> 2's complement
>
>
> On Mon, Sep 19, 2011 at 3:56 AM, Arun Vishwanathan > wrote:
>
>> Hi all,
>>
>> When I take negation of an integer in C, 0 is displayed as -1
>> ~5 is displayed as -6.
>> Can some one tell me the logic of h
0 this is fisrt a:
0 this is second a:
On Sun, Sep 18, 2011 at 12:09 PM, hurtlocker wrote:
> #include
>
> main()
>
> {
>
> int a ;
>
> a=abc();
>
> printf("\n %d this is fisrt a:",a);
>
> a=abc();
>
> printf("\n %d this is second a:",a);
>
> }
> int abc()
>
> {
>
> int i=2
http://www.hackchina.com/en/
On Fri, Jan 28, 2011 at 11:13 AM, pawan gangwani
wrote:
> Hi Rajeev/venu,
>
> i suggest you to think of a domain of you interest first, then proceed in
> that direction thinking of some project.
> have you thought of any domain in which you want to go for a project.
>
It can be done easily by counting sort
On Wed, Dec 15, 2010 at 5:36 AM, Soumya Prasad Ukil
wrote:
> Have a look : http://geeksforgeeks.org/?p=1488
>
>
> On 15 December 2010 05:19, Saurabh Koar wrote:
>
>> @ Bittu:
>>
>> Lets analyze your code with iterations:
>>
>> the array contains 1 3 3 1
ne interested in cryptography here? please let me know.regards,sudarshan- Original Message -From: "Peyman" <
[EMAIL PROTECTED]>To: "Algorithm Geeks" <algogeeks@googlegroups.com>Sent: Monday, January 02, 2006 9:00 PM
Subject: [algogeeks] Re: Hard mathematical fu
thematical function of that sort,ayway thanks for relying.
On 12/25/05, Mayur <[EMAIL PROTECTED]> wrote:
Gene probably meant a hash function. Encryption functions may not
necessarily be completely mathematical - since many of them operate on
bits (components of the real information).
Sarava
hi Gene, Thanks for replying Gene,but i want some mathematical functions like "factorization" something which deals purely with numbers,For example computing factors for very large numbers is hard but
verifying whether a number is a factor of that number is very simple,i
want some mathematical fu
hi guys,
Can u suggest a mathematical function which is extremely hard to
compute but very easy to verify.
for eg.Consider the factorization of large intergers,its hard to
compute but easy to verify
--Saravana Kumar--
