4 ms·
>algorithmic complexity of a shuffling algorithm is going to be a challenge, why even have a degree!? Because complexity analysis is a tiny part of a CS degree
by hueving 8y ago
>algorithmic complexity of a shuffling algorithm is going to be a challenge, why even have a degree!?
Because complexity analysis is a tiny part of a CS degree. A huge wing of our CS grad department focused on type theory and PL in general and could easily screw up a complexity analysis quiz like that because it's irrelevant to their day-to-day research/work.
- stcredzero 8y agoBecause complexity analysis is a tiny part of a CS degree Yes, but it's a slow-ball pitch! What's the complexity of filling in an array with its indices? If a CS grad can't solve something just a little more complex than that (for a sloppy/easy version of the question, not the shuffling algorithm expert version) then just what the heck are they learning?
- cuddlecake 8y agoIt's obviously constant. Duh!