oliverbth05

function insertionSort(arr) {

  for (var i = 1; i < arr.length; i++) {
     

    if (arr[i] < arr[i-1]) {
       for (var j = 0; j <= i; j++) {
           if (arr[j] > arr[i]) {
              var temp = arr[j];
              arr[j] = arr[i]

oliverbth05

function insertionSort(arr){
	var currentVal;
   for(var i = 1; i < arr.length; i++){
      currentVal = arr[i];    
		  
      for(var j = i - 1; j >= 0 && arr[j] > currentVal; j--) {
       		arr[j+1] = arr[j]
       }	
       
		  arr[j+1] = currentVal;

oliverbth05

function merge(arr1, arr2) {
 
  let i = 0;
  let j = 0;
  let merged = [];

  let arr1Full = false;
  let arr2Full = false;

  while (arr1Full === false && arr2Full === false) {

oliverbth05

function almostIncreasingSequence(sequence) {
    
    var i = 0;
    var spliced;

    function checkValid(arr) {

        if (i > sequence.length) {
            return false
        }