1) The most dificult part for me was the GCD algorithm. I have really ever cared to understand how it needs to work, since it is not something that you need to code all that often. I know that this is not a very hard part, but all the other sections are things we have covered extensivly in other CS classes.
2) The most interesting part for me was the prime number theorum. I have seen that there were a lot of large prime numbers, but I never knew that their was a formula that would allow us to solve for this.
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment