#25: Merging Lists

Tagged as challenge

Written on 2018-01-30

Part 1

Write a function merge-2 which takes two sorted lists and merges them into sorted order. This is an essential step of the merge sort algorithm.

Part 2

Write a function like merge-2 that instead takes any number of sorted sequences.

Part 3

Write these functions to work on infinite streams.

Unless otherwise credited all material copyright © 2010–2018 by Robert Smith