koku's life journal

NPRG062 (Introduction to algorithms) [lecture] - we were told about ways of finding if an item exists in an array including binary search (my beloved), but that one only works if the array is sorted.. se we went over some ways to order an array, bubble, selection and insert sorts all having O(n^2) and merge sort, which has O(nlog(n))

NPRG030 (Programming 1) [lecture] - boring class.. there are functions, you can have an f"string" which allows for formatting of sorts.. i don't really care.. at the end he wrote a program which counts all the instances of distinct words in input, he wanted to throw in romeo and juliet but couldn't find a plain text so he copied a whole site that had it, turns out that "Romeo" appeared 119 times, "Juliet" only 65 times and "love" 70 times

next week we don't have classes on tuesday bacuase of immatriculation and the next week we have a state holiday on tuesday..