Which is an example of decomposition in computational problem solving? a. Many different methods exist for sorting a list of numbers.
b. A list of numbers has a largest number and a smallest number.
c. A list of numbers can be sorted by comparing numbers two at a time.
d. A list of numbers can be sorted in numerical order.

c.A list of numbers can be sorted by comparing numbers two at a time.

Explanation:

In the case of computational thinking, decomposition is breaking a complex problem into smaller chunks. The problem can be as small as learning to tie your shoes or as large as constructing a new car that drives itself! In this Quest, you are going to learn how to break a complex problem into smaller chunks.

svsgfsgdgcsgshsjsghsjsj

interrup flag is set by

a.processor b. organization c.programer d. any one canset