3 points (1 points each). Match the sorting algorithms to the sequences, each of which represents some of

the first few intermediate steps in the sorting of an array of integers.

4

.

1

Sort A

281, 280, 203, 485, 388, 183, 490, 370

280, 281, 203, 485, 183, 388, 370, 490

203, 280, 281, 485, 183, 370, 388, 490

4

.

2

Sort B

477, 487, 381, 398, 280, 101, 490, 492

477, 381, 398, 280, 101, 487, 490, 492

381, 398, 280, 101, 477, 487, 490, 492

4

.

3

Sort C

281, 280, 203, 381, 482, 183, 445, 376

482, 381, 445, 376, 280, 183, 203, 281

445, 381, 281, 376, 280, 183, 203, 482

A.

Bubble sort

B.

Heap sort

C.

Insertion sort

D.

Merge sort

E.

Quick sort

F.

Selection sort