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

Record of attempt to implement sorting algorithm instead of a loop to find minimum error #5

Closed
wants to merge 2 commits into from

Conversation

warisa-r
Copy link
Owner

@warisa-r warisa-r commented Jul 7, 2024

With sorting: 16.794 s (9176227 allocations: 31.36 GiB)
Without sorting: 316.974 ms (1562699 allocations: 645.03 MiB)

@warisa-r
Copy link
Owner Author

warisa-r commented Jul 7, 2024

So it performs worse. Bulletpoint terminated

@warisa-r warisa-r closed this Jul 7, 2024
@warisa-r
Copy link
Owner Author

warisa-r commented Jul 8, 2024

@elenaiwnw Just want to notify you that this doesn't need to be done anymore

@warisa-r warisa-r deleted the sorting branch July 8, 2024 15:39
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