Skip to content

Conversation

@itziakos
Copy link
Contributor

@itziakos itziakos commented May 9, 2015

This PR updates the notes to include benchmarks for using a typed cpdef function for the Fibonacci function (recursive algorithm).

in more details:

  • All typed functions now return long to be consistent with the C implementation of the fibonacci function.
  • A new bechmark script is provided
  • Documentation is updated with the benchmarking of the typed cpdef (it is as fast or even faster than the hand written C wrapper.
  • A simple script is provided to create the comparison graph.
  • A testcase is added for the fibonacci functions.
  • A make.bat is provided for compiling the documentation under windows

Copy link
Contributor Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

I will need to also update the table and graphs about the cached based function.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

1 participant