search

nighthawkcoders / student

MIT License
1 stars 163 forks source link

2015 FRQ Q1 | CompSci Blogs #122

Open utterances-bot opened 4 months ago

utterances-bot commented 4 months ago

2015 FRQ Q1 | CompSci Blogs

2015 FRQ Q1

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

e-shen2022 commented 4 months ago

test

F1nnC commented 4 months ago

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 :)