DPS915 Toad
Revision as of 15:50, 14 October 2015 by Sandeep Joseph Saldanha (talk | contribs) (→PI Calculation)
Project Name Goes here
Team Members
Progress
Assignment 1
PI Calculation
Explanation
One of the profiles we decided to look at was the Monte Carlo PI Approximation method for solving the value of PI. We found that as the number of iterations increased exponentially by 10, so did our ability to get more digits for the value of PI. We believe that the scope of this program is too small to analyze as a group of 2 and are not using this as our program to solve.
Code
double xValue, yValue; for(int i = 0; i < npoints; i++) { //Generate random numbers xValue = (double) rand()/RAND_MAX; yValue = (double) rand()/RAND_MAX; if(sqrt((xValue*xValue)+(yValue*yValue)) <= 1) { circle_count++; } } double pi, ds; cout<<circle_count<<"/"<<npoints<<endl; ds = (double)circle_count/npoints; cout<<ds<<endl; pi = ((4.0)*ds); cout<<"PI = "<< pi <<endl;
"
Sample GPROF
Flat profile: Each sample counts as 0.01 seconds. no time accumulated % cumulative self self total time seconds seconds calls Ts/call Ts/call name 0.00 0.00 0.00 1 0.00 0.00 _GLOBAL__sub_I_main