-
Notifications
You must be signed in to change notification settings - Fork 26
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Feat: Schönhage–Strassen Algorithm Implementation #60
base: main
Are you sure you want to change the base?
Conversation
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
@HashirGJ8842 Will be considering this after Schonhage–Strassen algorithm optimization
Sure |
Here is an overview of what got changed by this pull request: Issues
======
- Added 1
See the complete overview on Codacy |
|
||
namespace libbig | ||
{ | ||
int char_int_converter(const char &x) { | ||
return ((x >= '0' && x <= '9') ? x - '0' : x + '0') ; | ||
} | ||
|
||
complexCoeffs fast_fourier_transform(const bool is_IDFT, const complexCoeffs num) { |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Codacy found an issue: Function parameter 'num' should be passed by const reference.
Description of Change
Added Schonhage Strassen Algorithm
Checklist