Please note, this is a STATIC archive of website www.w3resource.com from 19 Jul 2022, cach3.com does not collect or store any user information, there is no "phishing" involved.
w3resource

JavaScript Searching and Sorting Algorithm: Cocktail shaker sort

JavaScript Searching and Sorting Algorithm: Exercise-8 with Solution

Write a JavaScript program to sort a list of elements using Cocktail shaker sort.

Cocktail shaker sort (also known as bidirectional bubble sort, cocktail sort, shaker sort, ripple sort, shuffle sort, or shuttle sort ) is a variation of bubble sort that is both a stable sorting algorithm and a comparison sort. The algorithm differs from a bubble sort in that it sorts in both directions on each pass through the list. This sorting algorithm is only marginally more difficult to implement than a bubble sort, and solves the problem of turtles in bubble sorts. It provides only marginal performance improvements, and does not improve asymptotic performance; like the bubble sort, it is not of practical interest,, though it finds some use in education.

Visualization of shaker sort :

Sorting shaker sort animation

Sample Solution: -

HTML Code:

<!DOCTYPE html>
  <html>
  <head>
  <meta charset="utf-8">
  <title>JavaScript program of Cocktail sort</title>
  </head>
  <body></body>
</html>

JavaScript Code:

let nums = [4, 9, 0, 3, 1, 5];
console.log("Original array:");
console.log(nums);
let is_Sorted = true;
while (is_Sorted){
   for (let i = 0; i< nums.length - 1; i++){
           if (nums[i] > nums[i + 1])
            {
               let temp = nums[i];
               nums[i] = nums[i + 1];
               nums[i+1] = temp;
               is_Sorted = true;
            }
   }

   if (!is_Sorted)
       break;

   is_Sorted = false;

   for (let j = nums.length - 1; j > 0; j--){
           if (nums[j-1] > nums[j])
            {
               let temp = nums[j];
               nums[j] = nums[j - 1];
               nums[j - 1] = temp;
               is_Sorted = true;
            }
   }
}
console.log("Sorted array:")
console.log(nums);

Sample Output:

Original array:
[4,9,0,3,1,5]
Sorted array:
[0,1,3,4,5,9]

Flowchart:

JavaScript Searching and Sorting Algorithm Exercises: Cocktail sort

Live Demo:

See the Pen searching-and-sorting-algorithm-exercise-8 by w3resource (@w3resource) on CodePen.


Contribute your code and comments through Disqus.

Previous: Write a JavaScript program to sort a list of elements using Bubble sort.
Next: Write a JavaScript program to sort a list of elements using Comb sort.

What is the difficulty level of this exercise?

Test your Programming skills with w3resource's quiz.



JavaScript: Tips of the Day

How to insert an item into an array at a specific index (JavaScript)?

What you want is the splice function on the native array object.

arr.splice(index, 0, item); will insert item into arr at the specified index (deleting 0 items first, that is, it's just an insert). In this example we will create an array and add an element to it into index 2:

var arr = [];
arr[0] = "Jani";
arr[1] = "Hege";
arr[2] = "Stale";
arr[3] = "Kai Jim";
arr[4] = "Borge";

console.log(arr.join());
arr.splice(2, 0, "Lene");
console.log(arr.join());

Ref: https://bit.ly/2BXbp04