koku's life journal

NPRG062 (Introduction to algorithms) [lecture] - big O notation and then some examples of algorithms and their O. digital sum, testing if a number is prime and eratosthenes' sieve, which has O of n*log(log(n)), evaluating a polynomial at a certain point (Horner's method) which has O(n) and is used also for converting a string to an integer.

NPRG030 (Programming 1) [lecture] - we're doing python, which i'm competent at. the only thing i didn't already know is when comparing strings using the keyword is, if they've been initialised with the same string and it's short it returns True, if it's above a certain threshold then it returns False as expected