Primo Merge
implements a merge algorithm that merge two sorted lists into one sorted list
Set up
- clone this repository
- go into the directory:
cd primo_merge
- run
yarn
Run
- run
yarn start
after set up to open a repl - type list of number for collection 1 and 2 separated by a spacebar
- eg.
collection 1: > 1 2 3
- eg.
- the program evaluates the merge, and print out the result.
Test
- run
yarn test
after set up