FilesExpand file tree

 Development

/

SortUtils.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

45 lines (38 loc) · 1.18 KB

 Development

/

SortUtils.java

Copy path

Top

File metadata and controls

• Code
• Blame

45 lines (38 loc) · 1.18 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

package com.sorts;

final class SortUtils {

/**

* Helper method for swapping places in array

*

* @param array The array which elements we want to swap

* @param idx index of the first element

* @param idy index of the second element

*/

static <T> boolean swap(T[] array, int idx, int idy) {

T swap = array[idx];

array[idx] = array[idy];

array[idy] = swap;

return true;

}

/**

* This method checks if first element is less then the other element

*

* @param v first element

* @param w second element

* @return true if the first element is less then the second element

*/

static <T extends Comparable<T>> boolean less(T v, T w) {

return v.compareTo(w) < 0;

}

/**

* Swaps all position from {@param left} to @{@param right} for {@param array}

*

* @param array is an array

* @param left is a left flip border of the array

* @param right is a right flip border of the array

*/

static <T extends Comparable<T>> void flip(T[] array, int left, int right) {

while (left <= right) {

swap(array, left++, right--);

}

}

}