Sorting Exercises - Chapter 14 EPI C++

Completed Exercises: 14.1, 14.2, 14.4, 14.6, 14.9

For detailed description on each exercise, please refer to the notes document notes_epi_ch14.md

Changes Made

Added New Direcotyr: epi_ch14_sorting/
New Class: SortingExercisor
- Function: std::vector<int> ComputeListIntersection(const std::vector<int>& A1, const std::vector<int>& A2);
- Function: std::vector<int> ComputeListIntersectionAlt(const std::vector<int>& A1, const std::vector<int>& A2);
- Function: void MergeTwoSortedArrays(int A1[], int size_one, int A2[], int size_two);
- Function: int FindMaxSimultaneousEvents(std::vector<Event> event_list);
- Function: std::vector<Interval> ComputeIntervalUnions(std::vector<Interval> intervals);
- Function: std::shared_ptr<ListNode<int>> StableSortList(std::shared_ptr<ListNode<int>> L);