Monitor times spent in a matrix

I have homework, 2 parts

1. Initialize 2 square arrays (dynamically), then multiple them and save the result in third array. (I have done this part using list queue)

2. Monitor times spent in the matrix multiplication part. ??????
(i need this part)

Then test the code many times each time with different array size and monitor the time, so i can analyze the multiplication time as a function of array size.

Am working on windows xp / C++
I need time in microseconds


Thz

Quote:

---

Originally Posted by Rajaa

I have homework, 2 parts

1. Initialize 2 square arrays (dynamically), then multiple them and save the result in third array. (I have done this part using list queue)

2. Monitor times spent in the matrix multiplication part.

Then test the code many times each time with different array size and monitor the time, so i can analyze the multiplication time as a function of array size.

Thz

---

Nice. What do you want us to do about it?

So which OS/Compiler are you using?

What sort of time resolution are you looking for - microseconds? weeks?

.....

> Am working on windows xp / C++
C++ is the language
A compiler is like vs.net, dev-c++, borland 5.5

Anyway, just google your way through
http://www.google.co.uk/search?hs=p8...G=Search&meta=

Someone told me it is easier to solve this problem using Linux (He forget the correct command ) , dose anyone know How can I do that? ????

Rajaa

--double post--

Alright everybody, I did it for him ;)

Code:

---

/**
int[] test(int ntimes)

test() will run int mul_mat(int nsize) which should do a test on a matrix with size nsize,
the implementation is up to you. mul_mat() should always return 1 under normal operation.

It will run mul_mat() with increasing sizes of nsize, from 1 to ntimes, then time the results and return them
as an array of ints in microseconds.
**/

#include <ctime>
#include <windows.h>
int*test(int god){int lll,ll1[god],l1l=time(0);Sleep(INT_MAX/2097152);l1l=time(0)-l1l;while(god--)ll1[god]=1000000*(clock()-mul_mat(god)+1-clock()/l1l);}

---

> Someone told me it is easier to solve this problem using Linux
Yes, its
time myprog
But it's not microseconds like you asked.
It also times the process, not an individual function.

Read the link I posted if you want to read the high resolution clock in windows.

> .....
Please don't edit your post after replies to make those replies seem non-sensical.

Thanks jafet

I execute your code I get this error. : ‘test’: local function definitions are illegal. For this line [ int lll,ll1[god],l1l=time(0); ] , what shall I do??

Thanks Salem

There is no link!! Can u post it again.

Just this once....
click me