Algorithm Geeks Google Group

Re: ant problem

sumr...@gmail.com (Geoffrey Summerhayes) — Mon, 09 Nov 2009 04:07:21 UT

Simple enough, xe's analysis is correct,
except xe starts at L1. The ant starts at
the origin and moves to L1 with a probability
of 1, accounting for one extra minute.

So the answer is eight.

--
Geoff

Re: [algogeeks] measure running time on windows XP

amir.hossein.shahri...@gmail.com (Amir hossein Shahriari) — Sun, 08 Nov 2009 07:36:07 UT

in time.h there's a function named clock() which counts cpu clocks since the
beginning of your program
it also contains a constant named CLOCKS_PER_SEC
so if you divide clock() by CLOCKS_PER_SEC at the end of your code you'll
get the running time
(remember to cast the result to double to get the exact result)

measure running time on windows XP

shaker.far...@gmail.com (nikoo) — Sun, 08 Nov 2009 06:20:40 UT

Hi,
How can we measure running time of an algorithm on windows XP using
visual c++ ?

Thanks

انتخاب دختر شايسته ايران سال 1355

amin...@gmail.com (Aminooo~) — Sat, 07 Nov 2009 08:03:29 UT

سال 1355

مراسم انتخاب دختر شايسته ي ايران که از سال هاي دور ، به همّت مجله ي زن روز هر ساله در ايران انجام مي شد در سال 1355 نيز در هتل هيلتون تهران برگزار شد و بيست فيناليست اين مسابقه که در مدت طي مدت يک سال برگزيده شده بودند در شب فينال مسابقه با هم به رقابت پرداختند.

Re: [algogeeks] Sum of the Sequence

nikhilgar...@gmail.com (nikhil garg) — Sat, 07 Nov 2009 06:52:24 UT

Thanks a ton. I found finite calculus very interesting and useful !

--
nikhil-

Re: How to find number of Cycles in a Graph...

kunzmi...@atlas.cz (kunzmilan) — Sat, 07 Nov 2009 07:24:37 UT

Find polynomials of its adjacency matrix. The resulting polynomial
consists from loop, edge, cycle and edge-cycle polynomials.
kunzmilan

اصفهانيه و سرعت

amin...@gmail.com (Aminooo~) — Sat, 07 Nov 2009 07:00:18 UT

اصفهانيه داشته توي اتوبان با سرعت ۱۸۰ كيلومتر در ساعت مي رفته كه پليس با دوربينش شكارش مي كنه و ماشينشو متوقف مي كنه. پليسه مياد كنار ماشينو ميگه: گواهينامه و كارت ماشينو بدين.

ART

amin...@gmail.com (Aminooo~) — Sat, 07 Nov 2009 06:56:31 UT

Aminooo.com

Re: [algogeeks] How to find number of Cycles in a Graph...

afrozena...@gmail.com (Afroz Mohiuddin) — Sat, 07 Nov 2009 03:22:39 UT

This maybe of some use:
[link]

--
We are here on earth to do good for others. What the others are here for, I
don't know.

Afroz Mohiuddin
Final Year Masters Student

Re: [algogeeks] Re: ant problem

ankur.mast....@gmail.com (ankur aggarwal) — Fri, 06 Nov 2009 16:08:10 UT

@geoffery
plz give your method..

Re: [algogeeks] Re: ant problem

afrozena...@gmail.com (Afroz Mohiuddin) — Sat, 07 Nov 2009 02:25:03 UT

7 is correct

--
We are here on earth to do good for others. What the others are here for, I
don't know.

Afroz Mohiuddin
Final Year Masters Student
Dept Computer Science and Engineering
Indian Institute of Technology Kanpur
Kanpur - 208016
INDIA

Address: F-112 Hall 9
Telephone: [91]9838773891

Re: [algogeeks] Horse race

ssq...@gmail.com (Shiqing Shen) — Fri, 06 Nov 2009 09:18:44 UT

in the 6th race, you choose A1,B1,C1,D1,E! to race. you can get their
relative rank.
without lose generality, we choose A1,B1,C! as the fastest three horses, yes, E1
can be the fastest, and accordingly in 7th race, you must choose E2,E3 to race,
the same as you choose A2 ,A3 to race in 7th race when A1 is the fatest

Re: ant problem

sumr...@gmail.com (Geoffrey Summerhayes) — Fri, 06 Nov 2009 12:23:23 UT

Eight minutes.

--
Geoff

Re: [algogeeks] finding nth element of a tree without using recursion..

aryansmit3...@gmail.com (sharad kumar) — Fri, 06 Nov 2009 10:31:59 UT

stack<struct node *>st;
start with root
ptr=root;
while(ptr!=null&&count!=k)
{
st.push(ptr);
++count;
if(ptr->left!=null)
ptr=ptr->left
else
ptr=ptr->right

Re: [algogeeks] Sum of the Sequence

abhijith200...@gmail.com (abhijith reddy) — Fri, 06 Nov 2009 06:05:09 UT

Thank you so much ! :)

On Fri, Nov 6, 2009 at 11:00 AM, Prunthaban Kanthakumar <