-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathCyclicSort.java
More file actions
28 lines (24 loc) · 789 Bytes
/
Copy pathCyclicSort.java
File metadata and controls
28 lines (24 loc) · 789 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
import java.util.Arrays;
import java.util.Scanner;
public class CyclicSort {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println("Enter the size of the array: ");
int n = sc.nextInt();
int[] arr = new int[n];
System.out.println("Enter the elements of the array in range 1 to n only: ");
for (int i = 0; i < n; i++) {
arr[i] = sc.nextInt();
}
int i=0;
while(i<n){
int correctIn=arr[i]-1;
if(arr[i]!=arr[correctIn]){
int temp=arr[i];
arr[i]=arr[correctIn];
arr[correctIn]=temp;
}
else { i++; }}
System.out.println("Sorted array: ");
System.out.println(Arrays.toString(arr));
}}