FilesExpand file tree

 master

/

PancakeSort.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

70 lines (44 loc) · 1.43 KB

 master

/

PancakeSort.java

Copy path

Top

File metadata and controls

• Code
• Blame

70 lines (44 loc) · 1.43 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

58

59

60

61

62

63

64

65

66

67

68

69

70

import java.util.Arrays;

public class PancakeSort {

String complexity;

PancakeSort() {

complexity = ". Quadratic Time Complexity.";

}

void sort(int[] sortArray) {

/*

Begin Time Start

*/

double start = (double) System.nanoTime();

for (int stackSize = sortArray.length; stackSize > 1; stackSize--)

{

int maximum, count;

for (maximum = 0, count = 0; count < stackSize; count++) {

if (sortArray[count] > sortArray[maximum]) {

maximum = count;

}

}

if (maximum != stackSize - 1)

{

flipPancake(sortArray, maximum);

flipPancake(sortArray, stackSize - 1);

}

}

/*

End Time

*/

double end = (double) System.nanoTime();

System.out.println("PancakeSort: " + Arrays.toString(sortArray) + complexity + " Seconds taken was " + ((end - start) / 1000000));

}

int[] flipPancake(int[] sortArray, int flipNum) {

int tempInt, begin = 0;

while (begin < flipNum)

{

tempInt = sortArray[begin];

sortArray[begin] = sortArray[flipNum];

sortArray[flipNum] = tempInt;

begin++;

flipNum--;

}

return sortArray;

}

}