Advanced-DSA/CyclicSort.java at master · SoumyadeepMukherjee/Advanced-DSA · GitHub

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
// CYCLIC SORT

package com.Rhythm;

import java.util.Arrays;

public class CyclicSort {

    public static void main(String[] args) {

        int[] arr = {5, 4, 3, 2, 1};
        cyclic(arr);
        System.out.println(Arrays.toString(arr));

    }

//    static void cyclic(int[] arr){
//        int i = 0;
//        while (i < arr.length){
//            int correct = arr[i] - 1;
//            if (arr[i] != arr[correct]){
//                swap(arr, i, correct);
//            }
//            else{
//                i++;
//            }
//        }
//    }
//
//    static void swap(int[] arr, int first, int second){
//        int temp = arr[first];
//        arr[first] = arr[second];
//        arr[second] = temp;
//    }

    static void cyclic(int[] arr){
        int i = 0;
        while (i < arr.length){
            int correct = arr[i] - 1;
            if (arr[i] != arr[correct]){
                swap(arr, i, correct);
            }
            else{
                i++;
            }
        }
    }

    static void swap(int[] arr, int first, int second){
        int temp = arr[first];
        arr[first] = arr[second];
        arr[second] = temp;
    }

}