|
|
|
|
|
by bluefirebrand
1153 days ago
|
|
One example I can think of: A CS major is likely to have at least been exposed to the idea of Big-O estimating algorithmic complexity. A non-CS grad is much less likely to have. They may not even have a concept that estimating algorithmic complexity is even possible. They may have zero understanding why a massively nested loop structure is slow. |
|