Skip to content
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

Change worst case time complexity from quadratic to linear for moving min/max operator. #373

Merged
merged 10 commits into from Feb 21, 2024

Conversation

achoum
Copy link
Collaborator

@achoum achoum commented Feb 20, 2024

No description provided.

Copy link

Coverage report

Main: 91.20% | PR: 91.20% | Diff: 0.00 ✅

@achoum achoum marked this pull request as ready for review February 20, 2024 10:49
@achoum achoum changed the title Speed-up moving minimum Change worst case time complexity from quadratic to linear for moving min/max operator. Feb 20, 2024
@ianspektor ianspektor changed the base branch from main to gbm_moving_min_benchmark February 20, 2024 13:56
@ianspektor ianspektor requested review from javiber and removed request for ianspektor February 20, 2024 14:03
Base automatically changed from gbm_moving_min_benchmark to main February 21, 2024 11:11
@achoum
Copy link
Collaborator Author

achoum commented Feb 21, 2024

Thanks for the review.

Copy link

Coverage report

Main: 91.20% | PR: 91.20% | Diff: 0.00 ✅

@achoum achoum merged commit 97d8e21 into main Feb 21, 2024
22 checks passed
@achoum achoum deleted the gbm_speed_up_moving_min branch February 21, 2024 12:30
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.

None yet

2 participants