An algorithm is called stable if elements that are of the same value do not change their order after the sorting. (a) is merge-sort stable? (b) find a way to make any sorting algorithm stable (you can add additional data to every number).

answer: internal fragmentation is the difference between the (fixed) size of a memory hole and the data within in that memory. for example, if a 1,024 byte block of memory holds 800 bytes of data, then the 224 bytes difference is considered lost to internal fragmentation.

external fragmentation occurs when the sum of memory fragments is large enough to satisfy a request, but the holes are non-contiguous and the request cannot be satisfied. this can occur when memory is dynamically allocated and freed.

explanation:

something will pop up that says “know the answer? answer now! ” and you click on it and write your answer. after you are done, submit it.

answerapplication;