Merge Sort

Problem

Q: Write a function that takes a list of integers and returns the 4 highest in O(n) time.

A: Here, I use the merge sort algorithm since it uses O(n) space complexity and O(log(n)) runtime complexity.

Installation & Usage

1. Fork the repository.
2. Create a local clone of the fork by copying the clone URL:
   • URL
   • Note: these instructions are for using HTTPS
3. Open Terminal.
4. Navigate to the directory where you'd like to clone down the repo.
5. Type git clone, and then paste the URL.
6. Press Enter. Your local clone will be created.
7. cd into the merge-sort project directory.
8. Type node index.js to run the file.