- Cocktail Sort is a variation of Bubble sort. The Bubble sort algorithm always traverses elements from left and moves the largest element to its correct position in first iteration and second largest in second iteration and so on. Cocktail Sort traverses through a given array in both directions alternatively.
- Each iteration of the algorithm is broken up into 2 stages:
- The first stage loops through the array from left to right, just like the Bubble Sort. During the loop, adjacent items are compared and if value on the left is greater than the value on the right, then values are swapped. At the end of first iteration, largest number will reside at the end of the array.
- The second stage loops through the array in opposite direction- starting from the item just before the most recently sorted item, and moving back to the start of the array. Here also, adjacent items are compared and are swapped if required.
- This java example shows how to sort an element of Java ArrayList using Cocktail Sort method of Collections class.
- The program firstly assign some values including person's atttributes to its object and performs sort process in terms of each attribute title. All sort process is implemented by Turkish alphabetical order.
- src
- cocktailsort
- CocktailSortProcess.java
- main
- Main.java
- model
- Person.java
- util
- DefineValues.java
- ShowProcess.java
- cocktailsort
Files Names | Information |
---|---|
CocktailProcess.java | Implementing Cocktail Sort Process by Turkish alphabetical order |
Person.java | Defining it as a POJO |
Main.java | Handle with all project files to run the program |
ShowProcess.java | Showing all information about Person Object as output |
DefineValues.java | Filling its attributes into Person Object |