JavaAlgorithms/Sorts/PancakeSort.java

42 lines
945 B
Java
Raw Normal View History

2018-11-14 01:15:47 +08:00
package Sorts;
2018-11-14 01:15:47 +08:00
import static Sorts.SortUtils.*;
/**
2021-10-05 01:31:06 +08:00
* Implementation of pancake sort
*
* @author Podshivalov Nikita (https://github.com/nikitap492)
* @since 2018-04-10
2020-10-24 18:23:28 +08:00
*/
public class PancakeSort implements SortAlgorithm {
2020-10-24 18:23:28 +08:00
@Override
public <T extends Comparable<T>> T[] sort(T[] array) {
int size = array.length;
for (int i = 0; i < size; i++) {
T max = array[0];
int index = 0;
for (int j = 0; j < size - i; j++) {
if (less(max, array[j])) {
max = array[j];
index = j;
}
2020-10-24 18:23:28 +08:00
}
flip(array, index, array.length - 1 - i);
}
2020-10-24 18:23:28 +08:00
return array;
}
public static void main(String[] args) {
Integer[] arr = {
10, 9, 8, 7, 6, 15, 14, 7, 4, 3, 8, 6, 3, 1, 2, -2, -5, -8, -3, -1, 13, 12, 11, 5, 4, 3, 2, 1
};
PancakeSort pancakeSort = new PancakeSort();
System.out.println("After sorting:");
pancakeSort.sort(arr);
print(arr);
}
}