Many years ago, I heard from a Google engineer that 'O(n^2) rules the world'. The fact is that, in many cases, non-optimal algorithms are good enough just because the problems are small in size.
But you don't need to go back to college to learn. You can use many free resources (including online lectures on Computer Science from MIT) to brush up.
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
Many years ago, I heard from a Google engineer that 'O(n^2) rules the world'. The fact is that, in many cases, non-optimal algorithms are good enough just because the problems are small in size.
But you don't need to go back to college to learn. You can use many free resources (including online lectures on Computer Science from MIT) to brush up.