Why is it useful to understand coding fundamentals even if you work in a game design role that doesn’t traditionally write code?

Computers and Technology

1 answer:

Nutka1998 [239]2 years ago

4 0

Answer:

Learning to code not only prepares young minds for our increasingly tech-driven world, but also allows them to foster creativity, gain problem-solving skills, and improve their overall academic performance

Explanation:

You might be interested in

Al and Bill are arguing about the performance of their sorting algorithms. Al claims that his O(N log N)-time algorithm is alway

lisabon 2012 [21]

Answer:

See in Explanation

Explanation:

All you know is that an $O(n log n)$ algorithm is eventually (a lot) faster than an $O(n^{2} )$ algorithm, but for any specific value of n, you can't say anything. Indeed, the asymptotic growth of the function doesn't depend on its value on $n$ . This means that if $f(n)=O(n^{2} )$ then for all $c_{1} ,....\ , c_{99}$ , the following function is also $O(n^{2} )$ :

$f^{'} (n)=[\ cnf(n)\ if \ n$

So asymptotic notation is completely uninformative regarding the performance of algorithms on specific values of n.

You could say that functions such as $f^{'}(n)$ are artificial and never really occur in practice. This is not quite true (you can hard-code some auxiliary information for small n, for example), but even if you consider "natural" functions, asymptotic notation doesn't help you to determine anything other than asymptotic's: consider for example $n^{2}$ against $10^{100}n\ log \ n$ (such examples definitely happen in practice, for example in fast matrix multiplication).