Given an n x n array, return the array elements arranged from outermost elements to the middle element, traveling clockwise.

snail-sort-array.js

/**
array = [[1,2,3],
         [4,5,6],
         [7,8,9]]
snail(array) #=> [1,2,3,6,9,8,7,4,5]
**/
snail = function(array) {

  let results = [],
    botArray = [];

  while(array.length) {
    botArray=[];
    // step 1 - left to right
    if(array.length)
      results.push(...array.splice(0,1)[0]);
  
    // step 2 - top to bottom
    for(let b = 0; b < array.length; b++)
      results.push(array[b].pop());
  
    // step 3 - right to left
    if(array.length)
      botArray = array.splice(array.length-1,1)[0] || [];
    
    for(let a = 0; a < botArray.length; a++)
      botArray.splice(a,0, botArray.pop())
  
    results.push(...botArray);
    
    // step 4 - bottom to top
    for(let b = 0; b < array.length; b++)
      results.push(array[(array.length-1)-b].shift());
  }
  return results;
}