Question2 1 pts Consider the following three code fragments

Question2 1 pts Consider the following three code fragments: //Code Fragment 1: for (int elev = 0; elev

Solution

correct sequence is [3,2,1]

Code fragment 3:
-------------------
It nneds to allocate small 24 chunks and inside it will allocate 16000 chunks.
So mainly, the outer loop which contains less number of iterations will take less space.

So for
code 3 -> 24
code 2 --> 200
code 1 -> 16000

So best to worst is 3,2,1