FilesExpand file tree

 master

/

BogoSort.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

69 lines (46 loc) · 1.62 KB

 master

/

BogoSort.java

Copy path

Top

File metadata and controls

• Code
• Blame

69 lines (46 loc) · 1.62 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

import java.util.Arrays;

import java.util.Random;

public class BogoSort {

String complexity;

BogoSort() {

complexity = ". Infinite Time Complexity.";

}

void sort(int[] sortArray) {

/*

Begin Time Start

*/

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

while (sorted(sortArray) == false) {

System.out.println("BogoSort - Current Array is: " + Arrays.toString(sortArray));

sortArray = randomiseArray(sortArray);

}

/*

End Time

*/

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

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

}

boolean sorted(int[] sortedArray) {

for (int count = 1; count < sortedArray.length; count++) {

if (sortedArray[count] < sortedArray[count - 1]) {

return false;

}

}

return false;

}

int[] randomiseArray(int[] randomisedArray) {

Random random = new Random();

for (int count = 0; count < randomisedArray.length; count++) {

newSwap(randomisedArray, count, randomInteger(count));

}

return randomisedArray;

}

int randomInteger(int currentCounter) {

return (int)(Math.random() * currentCounter);

}

void newSwap(int[] newSwapArray, int first, int second) {

int tempInt = newSwapArray[first];

newSwapArray[first] = newSwapArray[second];

newSwapArray[second] = tempInt;

}

}