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

2015 FRQ Q1 | CompSci Blogs #122

Open
utterances-bot opened this issue Feb 27, 2024 · 2 comments
Open

2015 FRQ Q1 | CompSci Blogs #122

utterances-bot opened this issue Feb 27, 2024 · 2 comments

Comments

@utterances-bot
Copy link

2015 FRQ Q1 | CompSci Blogs

2015 FRQ Q1

https://e-shen2022.github.io/student/2024/02/24/frq1_IPYNB_2_.html

Copy link

test

Copy link

F1nnC commented Feb 27, 2024

For part A, we came up with the same solution of a enhanced for loop it. Part C was similar but Part B was a little bit different. your solution of jumping to the row and then calculating it was more efficient, because mine was a for loop that went until the correct row, and the calculated its row sums. Not that big of a time difference but mine wouldn't be scalable. Really good job.

0.95 :)

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

No branches or pull requests

3 participants