5 ms·
I think most of us would agree that you don't have to remember trivia like how bubblesort is implemented or which timezone is Papua New Guinea or some specific
by hombre_fatal 6y ago
I think most of us would agree that you don't have to remember trivia like how bubblesort is implemented or which timezone is Papua New Guinea or some specific syntax in a given language that you use thrice a year, but very few of us would fulfill your strawman that you literally don't have to know anything because you can just google it. The very meaning of this sort of trivia, like which element is #81 on the periodic table, is that it's not really a foundation for deeper general knowledge.
I'd be surprised if I met someone who saw themself in your comment.
- zeroxfe 6y agoFWIW, I don't consider bubblesort as trivia -- it's literally the simplest and most obvious sorting algorithm. IMO, it's a lot harder to understand more complex algorithms unless you have at least these basics in your head.
- hombre_fatal 6y agoKnowing the atomic number of all the elements on the periodic table is also very simple to memorize. The fact that you don't know them all isn't because it's hard nor complex. The same thing applies to bubblesort and every other thing you might not know off-hand without googling. Watch Jeopardy and ask yourself if any of the questions are particularly hard or complex to memorize. Perhaps that's not why you don't know them. I've implemented bubblesort at least 10 times in uni. I remember a few of the sorting algorithms I had to impl, but I forget which one is bubblesort. It would take me 10 seconds to go "oh right, that one" if I ever need to see it. I haven't had to in the 15 years since uni. Remembering that bubblesort is algo A vs algo B without googling it the one time I need to know is worthless. Knowing higher level concepts of sorting and perf trade-offs, on the other hand, is not. Having a set of trivia that you consider essential is itself trivia. As I could have my own arbitrary list of easily googleable essentials, like the wall socket voltage in every country in the world. No matter how handy I claim that knowledge is, it doesn't even pay its rent in the grey matter is takes up when you can just google it.
- daxxa1 6y agoBut you don't know what is at the other end of the spectrum you are on. What if someone knows these algorithms and has very good recall. Perhaps it becomes easier to reason about and mutate these ideas in their heads. Come up with new things, or do algorithmic things faster. I still think problem solving with newly gained knowledge is the way to go for retaining things longterm, but if you aided that process with something like Anki for meaningful connected information, you'd certainly be better off compared to someone who just does the former
- Izkata 6y agoIt's actually not - it's the simplest to implement. The most obvious conceptually is insertion or selection sort (depending on the person).
- xmprt 6y agoYou make it sound like bubble sort is trivia when in reality, it's quite useful in specific real world situations. If I need the top 3 elements of a list, bubble or insertion sort are the most efficient ways to do that. But that's something you wouldn't think about if you didn't know how bubble sort was implemented. Do you see how memorizing this can lead to creativity?
- contravariant 6y agoIf you need the top 3 elements then neither of those are efficient. Technically insertion sort is more efficient if you stop early, but the straightforward brute force algorithm will be faster by a factor of 3.
- xmprt 6y agoWhat would the brute force algorithm be? You mean like a 3 step selection sort?
- smiths1999 6y agoThey are probably thinking of simply going through the list and tracking the top 3. This gives you linear time but as you noted you can go faster with quickselect (edit: I originally mistakenly wrote selection sort despite thinking of quickselect), giving you linear time (edit: I original said logarithmic time, which is obviously wrong). I suppose it is besides the point, but you shouldn't be reaching for a specific algorithm but rather using your language's library sort algorithm.
- andi999 6y agoWhat do you nean with selection sort giving logarithmic time? I mean any algorithm finding anything unique on an unsorted list has to be at least O(n) or resort to magic.
- smiths1999 6y ago