Created 2 files, 1 with methods, another calling all those methods

systemscheck1-methods:
 1) returns the last element in an array
    (used if the given array has an odd number of elements)
 2) returns a new array with the last element removed
 3) compare_elements (not working yet): takes an array and compares in pairs
    if a number is bigger than the next, otherwise, swap places

other methods that may not use:
 4) split_arrays: splits given array into 2 arrays
 5) sort_swap_array: goes through array one-by-one, and swaps two
    elements if element1 > element2
First step in merge sort algorithm works, in compare_elements method

compare_elements method:
 1) executes the first step in merge sort
 2) can handle arrays with even and odd numbers of elements
 3) compares first 2 elements, second 2 elements, etc...
    and swaps if element1 > element2
 4) if odd number of elements in given array, pops last
    element, saves it in a variable, and adds it back on after
    the sorting is complete

merge_sort method:
 1) calls the compare_elements method
 2) will call other methods to complete all steps of merge sort,
    regardless of length of array
Wrote min and max methods

min: returns the first element in a sorted array
max: returns the last element in a sorted array
Changed compare_2elements method to return array of arrays

compare_2elements method:
 1) changed to return array of arrays, because wanted to split array elements
    to different arrays based on what has been sorted
 2) now splits 1 array into an array of 2-element arrays
 3) if there is an odd number, last number will be 1-element array
This completes the first step in the merge sort
Removed array1, array2, merge_array indexes

Realized didn't need to index which number to compare in
array1, array2, merged_array because if the number that was
merged into the new array is removed, you should always be
comparing the first number in each array

Used array.shift to remove the first element in the array
Step 2 of merge, merge 2-element arrays to become 4-element arrays

combine_arrays method:
 1) takes an array of arrays
 2) index1, index2 indicate which 2-element arrays to merge
 3) assumes that the 2-element arrays are already sorted
 4) returns an array of one 4-element array
Updated step 2 merge sort, works with 1-element arrays

use the flatten method in case the array of arrays contains
any 1-element arrays.
Created nest_last_array to nest a lone array into an array of arrays

used when there is an odd number of arrays, and need to run
combine_arrays again to sort the 2 arrays.
Starting over from scratch, to create a working version

starting over to create a working version by any means,
will then clean up later and translate to something
more efficient, and break up into methods as needed
Working version for 1 test case, sorting array

used a while loop, nested if, then nested while
 1) checks if neighboring numbers are sorted
 2) if no, swaps
 3) continues, if a number has been swapped, goes into nested while loop
    where checks to see if number before number recently swapped is
    larger. if so, swaps again, and continues until reaches beginning of array
Create average, max, min methods

using sort_swap_array method, created methods that calculates the
average, max, and min of a given array