fullstackDevelopment/Java/Random_programs/CyclicSort.java at main · ishangoyal13/fullstackDevelopment · GitHub

38 lines (36 loc) · 862 Bytes

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

// To sort an array in ascending and descending order using Cyclic Sort Algorithm.

import java.util.*;

class CyclicSort {

public static void main(String[] args) {

int arr1[] = {3,5,4,1,2};

int arr2[] = {3,5,4,1,2};

cyclicSortingAscending(arr1);

cyclicSortingDescending(arr2);

System.out.println(Arrays.toString(arr1));

System.out.println(Arrays.toString(arr2));

}

public static void cyclicSortingAscending(int arr[]) {

int i = 0;

while (i < arr.length) {

if (arr[i]-1 != i) {

int swap = arr[arr[i]-1];

arr[arr[i]-1] = arr[i];

arr[i] = swap;

}

else

i++;

}

}

public static void cyclicSortingDescending(int arr[]) {

int i = 0;

while (i < arr.length) {

if (i+arr[i] != arr.length) {

int swap = arr[arr.length-arr[i]];

arr[arr.length-arr[i]] = arr[i];

arr[i] = swap;

}

else

i++;

}

}

}