Question

Naturally, it would be nice to convert the entire output of make-change to the RLE format. Write a SCHEME function (rle-all lcoins) which, when given a list of coin changes, produces a list of RLE encoded coin-changes. For instance the call (rle-all (make-change 11 '(25 10 5 1))) produces (((11 . 1)) ((6. 1) (1 . 5)) ((1 . 1) (2 . 5)) ((1 . 1) (1 . 10))) which is a list of 4 lists (since there are four ways to give change on 11 cents) where each list is an RLE encoding.

Answer 1

Answer:

Bubble sort, sometimes referred to as sinking sort, is a simple sorting algorithm that repeatedly steps through the list, compares adjacent elements and swaps them if they are in the wrong order. The pass through the list is repeated until the list is sorted

Explanation: