Jump to: navigation, search


13 bytes removed, 18:16, 3 October 2014
no edit summary
My application that I selected is a PI approximation method. PI can be approximated in a number of ways however I chose to use the dartboard algorithm. Although not the fastest, the algorithm is very feasible to parallelize. The main idea behind it can be compared to a dartboard – you throw a random number (n) of darts at the board and note down the darts that have landed within it and those that have not. The image below demonstrates this concept:
  [[ImageFile:output.jpg|thumb|widthpx| ]]

Navigation menu