FilesExpand file tree

 master

/

WaveSort.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

46 lines (44 loc) · 1.71 KB

 master

/

WaveSort.java

Top

File metadata and controls

• Code
• Blame

46 lines (44 loc) · 1.71 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

package com.thealgorithms.sorts;

/**

* The WaveSort algorithm sorts an array so that every alternate element is greater than its adjacent elements.

* This implementation also provides a method to check if an array is wave sorted.

*/

public class WaveSort implements SortAlgorithm {

/**

* Sorts the given array such that every alternate element is greater than its adjacent elements.

*

* @param array The array to be sorted.

* @param <T> The type of elements in the array, which must be Comparable.

* @return The sorted array.

*/

@Override

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

for (int i = 0; i < array.length; i += 2) {

if (i > 0 && SortUtils.less(array[i], array[i - 1])) {

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

}

if (i < array.length - 1 && SortUtils.less(array[i], array[i + 1])) {

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

}

}

return array;

}

/**

* Checks if the given array is wave sorted. An array is wave sorted if every alternate element is greater than its adjacent elements.

*

* @param array The array to check.

* @param <T> The type of elements in the array, which must be Comparable.

* @return true if the array is wave sorted, false otherwise.

*/

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

for (int i = 0; i < array.length; i += 2) {

if (i > 0 && SortUtils.less(array[i], array[i - 1])) {

return false;

}

if (i < array.length - 1 && SortUtils.less(array[i], array[i + 1])) {

return false;

}

}

return true;

}

}