• You will need a 'for' loop that goes through each item of the array starting at index 1 (the second element).

• Begin looking left of that position and shift elements to the right (one-by-one) if they are larger than our temporary value (another loop).

• Each time you finish looking left and insert the item, that is called a completed pass.

• You know how to swap items in an array from Insertion Sort.

• shakerSort( ) is an adjustment of bubbleSort( )

• Large items bubble right (odd #'d passes), small items bubble left (even #'d passes)

• Reduce the length of each pass by 1 as items bubble to the appropriate end.

• By now you know how to go through an array and how to nest loops inside each other

• You should know how to reduce the search window by 1, similar to Bubble (shaker) Sort

• You should know how to swap items in an array

• What else is there to know?

let origSheeps = ['🐑', '🐑'];
let sheeps2 = origSheeps;

sheeps2.push('🐺');

console.log(sheeps2);
    // [ '🐑', '🐑', '🐺' ]

console.log(origSheeps);
    // [ '🐑', '🐑', '🐺' ]

😱 , our original sheeps have changed?!

(source)