Fix mistakes with binary trees & spectral norm #83
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
OverloadedOrama
changed the title
|
I also had made a mistake with the binary trees algorithm porting and the results were different than the ones from other languages, which I fixed in this PR. That resulted in the algorithm being even slower now, so I lowered the inputs. |
Calinou
reviewed
Jun 26, 2024
Calinou
reviewed
Jun 26, 2024
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
The spectral norm algorithm benchmark implemented in #68 had the wrong inputs. My bad! 馃槄
EDIT: I also improved its static typing, making it run quite faster.