FilesExpand file tree

 master

/

CocktailShakerSort.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

57 lines (51 loc) · 1.48 KB

 master

/

CocktailShakerSort.java

Copy path

Top

File metadata and controls

• Code
• Blame

57 lines (51 loc) · 1.48 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

48

49

50

51

52

53

54

55

56

57

package Sorts;

/**

* @author Mateus Bizzo (https://github.com/MattBizzo)

* @author Podshivalov Nikita (https://github.com/nikitap492)

*/

class CocktailShakerSort implements SortAlgorithm {

/**

* This method implements the Generic Cocktail Shaker Sort

*

* @param array The array to be sorted Sorts the array in increasing order

*/

@Override

public <T extends Comparable<T>> T[] sort(T[] array) {

int length = array.length;

int left = 0;

int right = length - 1;

int swappedLeft, swappedRight;

while (left < right) {

// front

swappedRight = 0;

for (int i = left; i < right; i++) {

if (SortUtils.less(array[i + 1], array[i])) {

SortUtils.swap(array, i, i + 1);

swappedRight = i;

}

}

// back

right = swappedRight;

swappedLeft = length - 1;

for (int j = right; j > left; j--) {

if (SortUtils.less(array[j], array[j - 1])) {

SortUtils.swap(array, j - 1, j);

swappedLeft = j;

}

}

left = swappedLeft;

}

return array;

}

// Driver Program

public static void main(String[] args) {

// Integer Input

Integer[] integers = {4, 23, 6, 78, 1, 54, 231, 9, 12};

CocktailShakerSort shakerSort = new CocktailShakerSort();

// Output => 1 4 6 9 12 23 54 78 231

SortUtils.print(shakerSort.sort(integers));

// String Input

String[] strings = {"c", "a", "e", "b", "d"};

SortUtils.print(shakerSort.sort(strings));

}

}