FilesExpand file tree

 master

/

cyclesort.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

78 lines (66 loc) · 2.12 KB

 master

/

cyclesort.java

Copy path

Top

File metadata and controls

• Code
• Blame

78 lines (66 loc) · 2.12 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

71

72

73

74

75

76

77

78

import java.util.*;

import java.lang.*;

class Sorting

{

// Function that sort the array using Cycle sort

public static void cycleSort (int arr[], int n)

{

// count number of memory writes

int writes = 0;

// traverse array elements

for (int cycle_start=0; cycle_start<=n-2; cycle_start++)

{

// initialize item as starting point

int item = arr[cycle_start];

// Find position where we put the item.

int pos = cycle_start;

for (int i = cycle_start+1; i<n; i++)

if (arr[i] < item)

pos++;

// If item is already in correct position

if (pos == cycle_start)

continue;

// ignore all duplicate elements

while (item == arr[pos])

pos += 1;

// put the item to it's right position

if (pos != cycle_start)

{

int temp = item;

item = arr[pos];

arr[pos] = temp;

writes++;

}

// Rotate rest of the cycle

while (pos != cycle_start)

{

pos = cycle_start;

// Find position where we put the element

for (int i = cycle_start+1; i<n; i++)

if (arr[i] < item)

pos += 1;

// ignore all duplicate elements

while (item == arr[pos])

pos += 1;

// put the item to it's right position

if (item != arr[pos])

{

int temp = item;

item = arr[pos];

arr[pos] = temp;

writes++;

}

}

}

}

// main program to test above function

public static void main(String[] args)

{

int arr[] = {1, 8, 3, 9, 10, 10, 2, 4 };

int n = arr.length;

cycleSort(arr, n) ;

System.out.println("After sort : ");

for (int i =0; i<n; i++)

System.out.print(arr[i] + " ");

}

}